YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:28:25,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:28:25,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:28:25,870 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:28:25,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:28:25,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:28:25,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:28:25,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:28:25,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:28:25,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:28:25,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:28:25,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:28:25,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:28:25,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:28:25,880 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:28:25,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:28:25,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:28:25,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:28:25,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:28:25,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:28:25,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:28:25,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:28:25,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:28:25,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:28:25,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:28:25,892 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:28:25,892 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:28:25,893 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:28:25,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:28:25,894 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:28:25,894 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:28:25,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:28:25,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:28:25,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:28:25,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:28:25,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:28:25,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:28:25,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:28:25,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:28:25,899 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:28:25,913 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:28:25,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:28:25,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:28:25,915 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:28:25,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:28:25,915 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:28:25,915 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:28:25,915 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:28:25,915 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:28:25,916 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:28:25,916 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:28:25,916 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:28:25,916 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:28:25,916 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:28:25,916 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:28:25,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:28:25,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:28:25,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:28:25,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:28:25,917 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:28:25,917 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:28:25,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:28:25,918 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:28:25,918 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:28:25,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:28:25,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:28:25,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:28:25,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:28:25,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:28:25,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:28:25,956 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:28:25,959 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:28:25,961 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:28:25,961 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:28:25,962 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:28:26,024 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/7050babe86584ed9bc70116938cef20b/FLAG14f027d15 !SESSION 2020-06-22 09:28:23.529 ----------------------------------------------- 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.cdt.core 1 0 2020-06-22 09:28:26.282 !MESSAGE Indexed 'FLAG14f027d15' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 09:28:26,363 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:28:26,364 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:28:26,364 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:28:26,371 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/7050babe86584ed9bc70116938cef20b/FLAG14f027d15 [2020-06-22 09:28:26,808 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/7050babe86584ed9bc70116938cef20b [2020-06-22 09:28:26,819 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:28:26,821 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:28:26,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:28:26,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:28:26,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:28:26,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:28:26" (1/1) ... [2020-06-22 09:28:26,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1243e7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:26, skipping insertion in model container [2020-06-22 09:28:26,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:28:26" (1/1) ... [2020-06-22 09:28:26,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:28:26,856 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:28:27,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:28:27,086 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:28:27,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:28:27,121 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:28:27,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27 WrapperNode [2020-06-22 09:28:27,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:28:27,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:28:27,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:28:27,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:28:27,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:28:27,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:28:27,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:28:27,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:28:27,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:28:27,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:28:27,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:28:27,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:28:27,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:28:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:28:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:28:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:28:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:28:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:28:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:28:27,607 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:28:27,608 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:28:27,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:27 BoogieIcfgContainer [2020-06-22 09:28:27,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:28:27,610 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:28:27,610 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:28:27,612 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:28:27,613 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:27" (1/1) ... [2020-06-22 09:28:27,634 INFO L313 BlockEncoder]: Initial Icfg 57 locations, 61 edges [2020-06-22 09:28:27,635 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:28:27,636 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:28:27,637 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:28:27,637 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:28:27,639 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:28:27,640 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:28:27,640 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:28:27,668 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:28:27,706 INFO L200 BlockEncoder]: SBE split 31 edges [2020-06-22 09:28:27,711 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:28:27,713 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:28:27,754 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:28:27,757 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:28:27,759 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:28:27,759 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:28:27,760 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:28:27,760 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:28:27,761 INFO L313 BlockEncoder]: Encoded RCFG 49 locations, 89 edges [2020-06-22 09:28:27,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:28:27 BasicIcfg [2020-06-22 09:28:27,761 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:28:27,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:28:27,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:28:27,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:28:27,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:28:26" (1/4) ... [2020-06-22 09:28:27,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6961cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:28:27, skipping insertion in model container [2020-06-22 09:28:27,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (2/4) ... [2020-06-22 09:28:27,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6961cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:28:27, skipping insertion in model container [2020-06-22 09:28:27,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:27" (3/4) ... [2020-06-22 09:28:27,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6961cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:28:27, skipping insertion in model container [2020-06-22 09:28:27,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:28:27" (4/4) ... [2020-06-22 09:28:27,769 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:28:27,779 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:28:27,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-06-22 09:28:27,804 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-06-22 09:28:27,833 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:28:27,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:28:27,834 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:28:27,834 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:28:27,834 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:28:27,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:28:27,834 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:28:27,835 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:28:27,835 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:28:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-06-22 09:28:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:28:27,856 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:27,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:28:27,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 135471, now seen corresponding path program 1 times [2020-06-22 09:28:27,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:27,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:28,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:28,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:28,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,068 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-06-22 09:28:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:28,278 INFO L93 Difference]: Finished difference Result 49 states and 89 transitions. [2020-06-22 09:28:28,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:28,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:28:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:28,293 INFO L225 Difference]: With dead ends: 49 [2020-06-22 09:28:28,293 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 09:28:28,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 09:28:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-06-22 09:28:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 09:28:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2020-06-22 09:28:28,337 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 3 [2020-06-22 09:28:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:28,339 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2020-06-22 09:28:28,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2020-06-22 09:28:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:28:28,339 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:28,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:28:28,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 135473, now seen corresponding path program 1 times [2020-06-22 09:28:28,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:28,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:28,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:28,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:28,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:28,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,369 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand 3 states. [2020-06-22 09:28:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:28,472 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2020-06-22 09:28:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:28,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:28:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:28,474 INFO L225 Difference]: With dead ends: 49 [2020-06-22 09:28:28,474 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 09:28:28,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 09:28:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-06-22 09:28:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 09:28:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 74 transitions. [2020-06-22 09:28:28,481 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 74 transitions. Word has length 3 [2020-06-22 09:28:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:28,481 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 74 transitions. [2020-06-22 09:28:28,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 74 transitions. [2020-06-22 09:28:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:28:28,482 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:28,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:28:28,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 135474, now seen corresponding path program 1 times [2020-06-22 09:28:28,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:28,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:28,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:28,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:28,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,522 INFO L87 Difference]: Start difference. First operand 44 states and 74 transitions. Second operand 3 states. [2020-06-22 09:28:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:28,655 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2020-06-22 09:28:28,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:28,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:28:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:28,657 INFO L225 Difference]: With dead ends: 44 [2020-06-22 09:28:28,657 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 09:28:28,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 09:28:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 09:28:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 09:28:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 69 transitions. [2020-06-22 09:28:28,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 69 transitions. Word has length 3 [2020-06-22 09:28:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:28,663 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 69 transitions. [2020-06-22 09:28:28,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. [2020-06-22 09:28:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:28:28,664 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:28,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:28:28,664 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 4196693, now seen corresponding path program 1 times [2020-06-22 09:28:28,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:28,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:28,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:28,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,702 INFO L87 Difference]: Start difference. First operand 39 states and 69 transitions. Second operand 3 states. [2020-06-22 09:28:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:28,843 INFO L93 Difference]: Finished difference Result 39 states and 69 transitions. [2020-06-22 09:28:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:28,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:28:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:28,845 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:28:28,845 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 09:28:28,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 09:28:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 09:28:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 09:28:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2020-06-22 09:28:28,851 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 4 [2020-06-22 09:28:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:28,851 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2020-06-22 09:28:28,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2020-06-22 09:28:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:28:28,852 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:28,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:28:28,852 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 4196694, now seen corresponding path program 1 times [2020-06-22 09:28:28,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:28,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:28,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:28,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:28,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:28,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:28,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,882 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 3 states. [2020-06-22 09:28:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:28,952 INFO L93 Difference]: Finished difference Result 39 states and 59 transitions. [2020-06-22 09:28:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:28,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:28:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:28,954 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:28:28,954 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 09:28:28,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 09:28:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 09:28:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 09:28:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. [2020-06-22 09:28:28,959 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 4 [2020-06-22 09:28:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:28,959 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. [2020-06-22 09:28:28,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2020-06-22 09:28:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:28:28,959 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:28,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:28:28,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:28,960 INFO L82 PathProgramCache]: Analyzing trace with hash 4196695, now seen corresponding path program 1 times [2020-06-22 09:28:28,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:28,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:28,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:28,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:28,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:28,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:28,994 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. [2020-06-22 09:28:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:29,082 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. [2020-06-22 09:28:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:29,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:28:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:29,083 INFO L225 Difference]: With dead ends: 34 [2020-06-22 09:28:29,084 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:28:29,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:28:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 09:28:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:28:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2020-06-22 09:28:29,088 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 4 [2020-06-22 09:28:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:29,088 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2020-06-22 09:28:29,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2020-06-22 09:28:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:28:29,089 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:29,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash 130095880, now seen corresponding path program 1 times [2020-06-22 09:28:29,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:29,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:29,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,119 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand 3 states. [2020-06-22 09:28:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:29,189 INFO L93 Difference]: Finished difference Result 29 states and 49 transitions. [2020-06-22 09:28:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:29,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:28:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:29,191 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:28:29,191 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:28:29,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:28:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:28:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:28:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2020-06-22 09:28:29,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 5 [2020-06-22 09:28:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:29,195 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. [2020-06-22 09:28:29,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. [2020-06-22 09:28:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:28:29,196 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:29,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,196 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 130095882, now seen corresponding path program 1 times [2020-06-22 09:28:29,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:29,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:29,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:29,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,219 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 3 states. [2020-06-22 09:28:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:29,274 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-06-22 09:28:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:29,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:28:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:29,275 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:28:29,275 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:28:29,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:28:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:28:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:28:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2020-06-22 09:28:29,278 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 5 [2020-06-22 09:28:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:29,279 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2020-06-22 09:28:29,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2020-06-22 09:28:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:28:29,280 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:29,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,280 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 09:28:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash 130095883, now seen corresponding path program 1 times [2020-06-22 09:28:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:29,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:29,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:29,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:29,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:29,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,309 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 3 states. [2020-06-22 09:28:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:29,364 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. [2020-06-22 09:28:29,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:29,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:28:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:29,365 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:28:29,365 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:28:29,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:28:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:28:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:28:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:28:29,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 09:28:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:29,367 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:28:29,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:28:29,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:28:29,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:28:29,419 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:28:29,419 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:28:29,419 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:28:29,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:28:29,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:28:29,422 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 09:28:29,422 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 09:28:29,422 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,422 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point L13-6(lines 13 19) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point L13-8(lines 13 19) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:28:29,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2020-06-22 09:28:29,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:28:29,425 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 18) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 09:28:29,425 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:28:29,425 INFO L444 ceAbstractionStarter]: At program point L14-4(lines 12 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 09:28:29,425 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:28:29,425 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:28:29,426 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:28:29,426 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:28:29,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:29,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:28:29 BasicIcfg [2020-06-22 09:28:29,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:28:29,449 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:28:29,449 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:28:29,452 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:28:29,453 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:29,453 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:28:26" (1/5) ... [2020-06-22 09:28:29,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5268daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:28:29, skipping insertion in model container [2020-06-22 09:28:29,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:29,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:27" (2/5) ... [2020-06-22 09:28:29,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5268daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:28:29, skipping insertion in model container [2020-06-22 09:28:29,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:29,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:27" (3/5) ... [2020-06-22 09:28:29,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5268daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:28:29, skipping insertion in model container [2020-06-22 09:28:29,455 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:29,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:28:27" (4/5) ... [2020-06-22 09:28:29,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5268daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:28:29, skipping insertion in model container [2020-06-22 09:28:29,455 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:29,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:28:29" (5/5) ... [2020-06-22 09:28:29,457 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:28:29,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:28:29,477 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:28:29,477 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:28:29,477 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:28:29,478 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:28:29,478 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:28:29,478 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:28:29,478 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:28:29,478 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:28:29,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-06-22 09:28:29,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 09:28:29,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:29,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:29,492 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,492 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:29,492 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:28:29,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-06-22 09:28:29,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 09:28:29,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:29,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:29,495 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,495 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:29,501 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [104] 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] 8#L-1true [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 9#L10true [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 44#L10-1true [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 22#L11true [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 10#L14-4true [2020-06-22 09:28:29,501 INFO L796 eck$LassoCheckResult]: Loop: 10#L14-4true [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 49#L13true [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 47#L13-1true [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 46#L13-2true [141] L13-2-->L13-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short6_5|) InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} AuxVars[] AssignedVars[] 30#L13-6true [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 12#L14-3true [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 14#L14-1true [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 10#L14-4true [2020-06-22 09:28:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 1 times [2020-06-22 09:28:29,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,550 INFO L82 PathProgramCache]: Analyzing trace with hash 899451794, now seen corresponding path program 1 times [2020-06-22 09:28:29,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:29,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:29,565 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:28:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,567 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-06-22 09:28:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:29,733 INFO L93 Difference]: Finished difference Result 51 states and 91 transitions. [2020-06-22 09:28:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:29,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 91 transitions. [2020-06-22 09:28:29,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 09:28:29,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 22 states and 34 transitions. [2020-06-22 09:28:29,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 09:28:29,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 09:28:29,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2020-06-22 09:28:29,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:29,742 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-06-22 09:28:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2020-06-22 09:28:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-06-22 09:28:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:28:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-06-22 09:28:29,746 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 09:28:29,746 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 09:28:29,747 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:28:29,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2020-06-22 09:28:29,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 09:28:29,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:29,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:29,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,748 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:29,749 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY [104] 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] 120#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 121#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 118#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 119#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 122#L14-4 [2020-06-22 09:28:29,749 INFO L796 eck$LassoCheckResult]: Loop: 122#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 123#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 128#L13-1 [212] L13-1-->L13-2: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short6_2|) (> |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 129#L13-2 [141] L13-2-->L13-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short6_5|) InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} AuxVars[] AssignedVars[] 116#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 115#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 127#L14-1 [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 122#L14-4 [2020-06-22 09:28:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 2 times [2020-06-22 09:28:29,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 900375315, now seen corresponding path program 1 times [2020-06-22 09:28:29,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:29,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:29,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:29,788 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:28:29,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:29,789 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-06-22 09:28:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:29,829 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2020-06-22 09:28:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:29,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 32 transitions. [2020-06-22 09:28:29,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 09:28:29,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 28 transitions. [2020-06-22 09:28:29,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 09:28:29,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 09:28:29,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-06-22 09:28:29,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:29,831 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-06-22 09:28:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-06-22 09:28:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:28:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:28:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-06-22 09:28:29,833 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-06-22 09:28:29,833 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-06-22 09:28:29,833 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:28:29,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-06-22 09:28:29,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 09:28:29,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:29,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:29,835 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:29,835 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:29,836 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY [104] 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] 169#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 170#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 166#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 167#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 171#L14-4 [2020-06-22 09:28:29,836 INFO L796 eck$LassoCheckResult]: Loop: 171#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 172#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 177#L13-1 [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 175#L13-2 [140] L13-2-->L13-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_3| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} AuxVars[] AssignedVars[] 173#L13-3 [137] L13-3-->L13-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 168#L13-4 [218] L13-4-->L13-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_3|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 165#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 164#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 176#L14-1 [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 171#L14-4 [2020-06-22 09:28:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 3 times [2020-06-22 09:28:29,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1073596322, now seen corresponding path program 1 times [2020-06-22 09:28:29,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:29,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:29,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:29,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:28:29,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:28:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:28:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:28:29,932 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-06-22 09:28:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:30,100 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-06-22 09:28:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:28:30,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2020-06-22 09:28:30,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 09:28:30,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 32 transitions. [2020-06-22 09:28:30,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 09:28:30,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 09:28:30,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-06-22 09:28:30,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:30,103 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 09:28:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-06-22 09:28:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-06-22 09:28:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:28:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-06-22 09:28:30,104 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-06-22 09:28:30,105 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-06-22 09:28:30,105 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:28:30,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-06-22 09:28:30,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 09:28:30,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:30,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:30,106 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:30,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:30,107 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY [104] 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] 235#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 236#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 232#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 233#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 237#L14-4 [2020-06-22 09:28:30,107 INFO L796 eck$LassoCheckResult]: Loop: 237#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 238#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 243#L13-1 [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 241#L13-2 [140] L13-2-->L13-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_3| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} AuxVars[] AssignedVars[] 239#L13-3 [137] L13-3-->L13-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 234#L13-4 [218] L13-4-->L13-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_3|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 230#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 231#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 244#L14-1 [99] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 223#L15 [101] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 224#L15-1 [252] L15-1-->L16: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 227#L16 [118] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 225#L16-1 [253] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 226#L17 [131] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 228#L17-1 [254] L17-1-->L14-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 229#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 242#L14-1 [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 237#L14-4 [2020-06-22 09:28:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 4 times [2020-06-22 09:28:30,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash 279799391, now seen corresponding path program 1 times [2020-06-22 09:28:30,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:30,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:30,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1657278937, now seen corresponding path program 1 times [2020-06-22 09:28:30,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:30,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:30,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:30,454 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-06-22 09:28:30,855 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2020-06-22 09:28:31,032 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-06-22 09:28:31,045 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:28:31,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:28:31,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:28:31,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:28:31,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:28:31,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:28:31,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:28:31,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:28:31,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:28:31,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:28:31,047 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:28:31,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,424 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-06-22 09:28:31,566 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-06-22 09:28:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:31,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:32,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:28:32,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:28:32,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:28:32,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:28:32,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:28:32,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:28:32,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:28:32,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:28:32,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:28:32,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:28:32,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:28:32,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:28:32,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:28:32,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:28:32,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:32,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:32,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:28:32,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:28:32,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:28:32,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:32,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:32,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:32,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:32,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:32,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:28:32,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:32,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:32,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:32,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:32,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:32,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:32,116 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:28:32,130 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:28:32,130 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:28:32,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:28:32,135 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:28:32,135 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:28:32,135 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:28:32,222 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:28:32,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:28:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:32,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:28:32,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:32,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:28:32,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:32,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 35 treesize of output 19 [2020-06-22 09:28:32,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:32,416 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:32,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 09:28:32,417 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 09:28:32,459 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:32,460 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 1 case distinctions, treesize of input 23 treesize of output 48 [2020-06-22 09:28:32,464 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:32,490 INFO L497 ElimStorePlain]: treesize reduction 18, result has 65.4 percent of original size [2020-06-22 09:28:32,491 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 09:28:32,491 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:25 [2020-06-22 09:28:32,522 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2020-06-22 09:28:32,523 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:32,531 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 30 treesize of output 29 [2020-06-22 09:28:32,532 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:32,555 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:32,556 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:28:32,556 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2020-06-22 09:28:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:32,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:28:32,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:32,863 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 09:28:32,863 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:32,872 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:32,873 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 09:28:32,873 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 09:28:32,932 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:32,933 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 2 case distinctions, treesize of input 30 treesize of output 63 [2020-06-22 09:28:32,939 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:32,998 INFO L497 ElimStorePlain]: treesize reduction 35, result has 57.8 percent of original size [2020-06-22 09:28:33,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:28:33,000 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2020-06-22 09:28:38,518 WARN L188 SmtUtils]: Spent 2.75 s on a formula simplification that was a NOOP. DAG size: 26 [2020-06-22 09:28:38,538 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 09:28:38,538 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:38,546 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:38,546 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:38,547 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 09:28:39,921 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) c_oldRank0)) is different from true [2020-06-22 09:28:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:39,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 09:28:39,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:40,099 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:40,099 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 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 09:28:40,105 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:40,156 INFO L497 ElimStorePlain]: treesize reduction 56, result has 41.1 percent of original size [2020-06-22 09:28:40,157 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 09:28:40,158 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:42 [2020-06-22 09:28:40,303 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:40,304 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 2 case distinctions, treesize of input 41 treesize of output 70 [2020-06-22 09:28:40,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:40,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2020-06-22 09:28:40,319 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:40,402 INFO L497 ElimStorePlain]: treesize reduction 71, result has 41.8 percent of original size [2020-06-22 09:28:40,403 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:28:40,404 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:36 [2020-06-22 09:28:40,526 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 34 treesize of output 26 [2020-06-22 09:28:40,526 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:40,561 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:40,561 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 89 [2020-06-22 09:28:40,571 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:40,652 INFO L497 ElimStorePlain]: treesize reduction 94, result has 44.0 percent of original size [2020-06-22 09:28:40,654 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-06-22 09:28:40,654 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:57 [2020-06-22 09:28:45,280 WARN L188 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 36 [2020-06-22 09:28:51,534 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset)) (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:28:52,568 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) is different from true [2020-06-22 09:28:53,504 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:28:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:54,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:54,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:54,039 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2020-06-22 09:28:54,040 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,041 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:54,041 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,041 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 [2020-06-22 09:28:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:54,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:54,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:54,735 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2020-06-22 09:28:54,735 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,737 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:54,737 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,737 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 [2020-06-22 09:28:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:54,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:54,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:54,948 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2020-06-22 09:28:54,949 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,950 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:54,950 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,950 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 [2020-06-22 09:28:54,967 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:54,968 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 22 [2020-06-22 09:28:54,970 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:28:54,980 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size [2020-06-22 09:28:54,981 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:54,981 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 [2020-06-22 09:28:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:55,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:55,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:55,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2020-06-22 09:28:55,211 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,213 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:55,213 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,213 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 [2020-06-22 09:28:55,226 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:55,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 22 [2020-06-22 09:28:55,228 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:28:55,237 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size [2020-06-22 09:28:55,237 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,237 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 [2020-06-22 09:28:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:55,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:55,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:55,378 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2020-06-22 09:28:55,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,380 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:55,380 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,380 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 [2020-06-22 09:28:55,402 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:55,403 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 22 [2020-06-22 09:28:55,405 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:28:55,418 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size [2020-06-22 09:28:55,419 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,419 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 [2020-06-22 09:28:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:55,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:55,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:55,559 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2020-06-22 09:28:55,559 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,561 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:55,561 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,561 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 [2020-06-22 09:28:55,578 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:55,578 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 22 [2020-06-22 09:28:55,580 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:28:55,590 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size [2020-06-22 09:28:55,590 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:55,591 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 [2020-06-22 09:28:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:55,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:55,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:56,106 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:56,107 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 25 [2020-06-22 09:28:56,108 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:28:56,124 INFO L497 ElimStorePlain]: treesize reduction 16, result has 42.9 percent of original size [2020-06-22 09:28:56,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 09:28:56,125 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2020-06-22 09:28:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:56,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:28:56,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:56,369 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 09:28:56,370 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:56,378 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:56,378 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 09:28:56,379 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 09:28:56,405 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:56,406 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 2 case distinctions, treesize of input 30 treesize of output 63 [2020-06-22 09:28:56,409 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:56,454 INFO L497 ElimStorePlain]: treesize reduction 43, result has 52.7 percent of original size [2020-06-22 09:28:56,455 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:28:56,455 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2020-06-22 09:28:56,472 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 09:28:56,472 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:28:56,480 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:28:56,480 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:28:56,480 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 09:28:56,499 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 48 predicates after loop cannibalization [2020-06-22 09:28:56,503 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 48 loop predicates [2020-06-22 09:28:56,504 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 30 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-06-22 09:29:14,600 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2020-06-22 09:29:15,765 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 30 transitions. cyclomatic complexity: 9. Second operand 10 states. Result 325 states and 345 transitions. Complement of second has 217 states. [2020-06-22 09:29:15,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 64 states 4 stem states 54 non-accepting loop states 5 accepting loop states [2020-06-22 09:29:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:29:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 176 transitions. [2020-06-22 09:29:15,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 176 transitions. Stem has 5 letters. Loop has 17 letters. [2020-06-22 09:29:15,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:29:15,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 176 transitions. Stem has 22 letters. Loop has 17 letters. [2020-06-22 09:29:15,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:29:15,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 176 transitions. Stem has 5 letters. Loop has 34 letters. [2020-06-22 09:29:15,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:29:15,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 345 transitions. [2020-06-22 09:29:15,789 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2020-06-22 09:29:15,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 110 states and 117 transitions. [2020-06-22 09:29:15,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-06-22 09:29:15,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2020-06-22 09:29:15,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 117 transitions. [2020-06-22 09:29:15,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:29:15,792 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 117 transitions. [2020-06-22 09:29:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 117 transitions. [2020-06-22 09:29:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 20. [2020-06-22 09:29:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:29:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-06-22 09:29:15,795 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 09:29:15,795 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 09:29:15,795 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:29:15,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-06-22 09:29:15,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:29:15,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:29:15,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:29:15,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:29:15,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:29:15,797 INFO L794 eck$LassoCheckResult]: Stem: 1671#ULTIMATE.startENTRY [104] 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] 1666#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1667#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1664#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1665#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1669#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1670#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1674#L13-1 [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 1673#L13-2 [140] L13-2-->L13-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_3| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} AuxVars[] AssignedVars[] 1668#L13-3 [137] L13-3-->L13-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1663#L13-4 [218] L13-4-->L13-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_3|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 1662#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 1661#L14-3 [2020-06-22 09:29:15,798 INFO L796 eck$LassoCheckResult]: Loop: 1661#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1672#L14-1 [99] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1655#L15 [101] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1656#L15-1 [252] L15-1-->L16: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 1659#L16 [118] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1657#L16-1 [253] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 1658#L17 [131] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1660#L17-1 [254] L17-1-->L14-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 1661#L14-3 [2020-06-22 09:29:15,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:29:15,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1186347573, now seen corresponding path program 1 times [2020-06-22 09:29:15,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:29:15,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:29:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:29:15,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:29:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:29:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:29:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1347355646, now seen corresponding path program 1 times [2020-06-22 09:29:15,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:29:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:29:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:29:15,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:29:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:29:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:29:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 538036786, now seen corresponding path program 1 times [2020-06-22 09:29:15,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:29:15,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:29:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:29:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:29:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:29:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:16,315 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2020-06-22 09:29:16,448 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 09:29:16,451 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:29:16,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:29:16,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:29:16,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:29:16,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:29:16,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:29:16,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:29:16,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:29:16,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 09:29:16,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:29:16,453 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:29:16,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,764 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2020-06-22 09:29:16,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:29:16,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 09:29:17,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:29:17,292 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:29:17,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:29:17,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:29:17,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:29:17,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:29:17,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:29:17,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:29:17,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:29:17,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:29:17,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:29:17,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:29:17,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:29:17,382 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:29:17,398 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 09:29:17,398 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 09:29:17,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:29:17,400 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:29:17,400 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:29:17,401 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-06-22 09:29:17,478 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:29:17,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:29:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:29:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:29:17,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:29:17,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:29:17,530 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 14 treesize of output 12 [2020-06-22 09:29:17,530 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:17,535 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:17,535 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:29:17,536 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2020-06-22 09:29:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:29:17,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:29:17,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:29:17,617 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:17,618 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 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 09:29:17,622 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:17,681 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size [2020-06-22 09:29:17,682 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:29:17,682 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 [2020-06-22 09:29:21,933 WARN L188 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 26 [2020-06-22 09:29:23,376 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 39 treesize of output 23 [2020-06-22 09:29:23,376 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:23,382 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 37 treesize of output 25 [2020-06-22 09:29:23,382 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:23,408 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size [2020-06-22 09:29:23,408 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 09:29:23,409 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 [2020-06-22 09:29:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:29:24,857 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true [2020-06-22 09:29:26,319 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true [2020-06-22 09:29:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:26,395 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:29:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:29:26,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:29:26,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:29:26,433 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 09:29:26,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,439 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:26,439 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 09:29:26,439 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 09:29:26,464 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 09:29:26,465 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,471 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:26,471 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,471 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-06-22 09:29:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:29:26,558 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:29:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:29:26,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:29:26,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:29:26,573 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 09:29:26,573 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,580 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:26,580 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,580 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 09:29:26,608 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:26,608 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 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 09:29:26,612 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,667 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size [2020-06-22 09:29:26,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:29:26,668 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 [2020-06-22 09:29:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:29:26,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:29:26,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:29:26,711 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 09:29:26,712 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,720 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:26,721 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,721 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 09:29:26,753 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:29:26,753 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 2 case distinctions, treesize of input 35 treesize of output 64 [2020-06-22 09:29:26,757 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,816 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size [2020-06-22 09:29:26,817 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:29:26,818 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 [2020-06-22 09:29:26,833 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 37 treesize of output 25 [2020-06-22 09:29:26,833 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,838 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 39 treesize of output 23 [2020-06-22 09:29:26,839 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:29:26,858 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size [2020-06-22 09:29:26,859 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 09:29:26,859 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 [2020-06-22 09:29:26,880 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 09:29:26,880 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2020-06-22 09:29:26,880 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-06-22 09:29:29,898 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 29 states and 37 transitions. Complement of second has 15 states. [2020-06-22 09:29:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2020-06-22 09:29:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 09:29:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-06-22 09:29:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-22 09:29:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:29:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 20 letters. Loop has 8 letters. [2020-06-22 09:29:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:29:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 12 letters. Loop has 16 letters. [2020-06-22 09:29:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:29:29,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2020-06-22 09:29:29,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:29:29,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2020-06-22 09:29:29,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:29:29,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:29:29,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:29:29,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:29:29,926 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:29:29,926 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:29:29,926 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:29:29,927 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 09:29:29,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:29:29,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:29:29,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:29:29,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:29:29 BasicIcfg [2020-06-22 09:29:29,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:29:29,935 INFO L168 Benchmark]: Toolchain (without parser) took 63115.18 ms. Allocated memory was 649.6 MB in the beginning and 982.0 MB in the end (delta: 332.4 MB). Free memory was 559.9 MB in the beginning and 559.2 MB in the end (delta: 682.3 kB). Peak memory consumption was 333.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,936 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 581.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:29:29,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.17 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 559.9 MB in the beginning and 647.7 MB in the end (delta: -87.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 684.2 MB. Free memory was 647.7 MB in the beginning and 645.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,937 INFO L168 Benchmark]: Boogie Preprocessor took 25.10 ms. Allocated memory is still 684.2 MB. Free memory was 645.0 MB in the beginning and 643.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,937 INFO L168 Benchmark]: RCFGBuilder took 418.13 ms. Allocated memory is still 684.2 MB. Free memory was 643.6 MB in the beginning and 617.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,938 INFO L168 Benchmark]: BlockEncodingV2 took 151.44 ms. Allocated memory is still 684.2 MB. Free memory was 617.0 MB in the beginning and 604.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,938 INFO L168 Benchmark]: TraceAbstraction took 1685.72 ms. Allocated memory is still 684.2 MB. Free memory was 604.9 MB in the beginning and 403.6 MB in the end (delta: 201.3 MB). Peak memory consumption was 201.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,939 INFO L168 Benchmark]: BuchiAutomizer took 60485.77 ms. Allocated memory was 684.2 MB in the beginning and 982.0 MB in the end (delta: 297.8 MB). Free memory was 403.6 MB in the beginning and 559.2 MB in the end (delta: -155.6 MB). Peak memory consumption was 142.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:29:29,942 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 57 locations, 61 edges - StatisticsResult: Encoded RCFG 49 locations, 89 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 581.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 300.17 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 559.9 MB in the beginning and 647.7 MB in the end (delta: -87.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 684.2 MB. Free memory was 647.7 MB in the beginning and 645.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.10 ms. Allocated memory is still 684.2 MB. Free memory was 645.0 MB in the beginning and 643.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 418.13 ms. Allocated memory is still 684.2 MB. Free memory was 643.6 MB in the beginning and 617.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 151.44 ms. Allocated memory is still 684.2 MB. Free memory was 617.0 MB in the beginning and 604.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1685.72 ms. Allocated memory is still 684.2 MB. Free memory was 604.9 MB in the beginning and 403.6 MB in the end (delta: 201.3 MB). Peak memory consumption was 201.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 60485.77 ms. Allocated memory was 684.2 MB in the beginning and 982.0 MB in the end (delta: 297.8 MB). Free memory was 403.6 MB in the beginning and 559.2 MB in the end (delta: -155.6 MB). Peak memory consumption was 142.2 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 10]: 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: 17]: 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: 13]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: 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: 15]: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 09:29:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 09:29:29,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:29:29,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 28 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 405 SDslu, 6 SDs, 0 SdLazy, 418 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 64 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 60.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 3.8s. Büchi inclusion checks took 52.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 93 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 94 SDtfs, 333 SDslu, 309 SDs, 0 SdLazy, 1897 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital446 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 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! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:29:30.191 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check