./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:36:40,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:36:40,430 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2024-11-14 03:36:40,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:36:40,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:36:40,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:36:40,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:36:40,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:36:40,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:36:40,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:36:40,478 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:36:40,478 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:36:40,478 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:36:40,478 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:36:40,478 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:36:40,478 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:36:40,479 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:36:40,479 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:36:40,479 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:36:40,479 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:36:40,480 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:36:40,480 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:36:40,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:36:40,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:36:40,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:36:40,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:36:40,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:36:40,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:36:40,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:36:40,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:36:40,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:36:40,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:36:40,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:36:40,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:36:40,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:36:40,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:36:40,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:36:40,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:36:40,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:36:40,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:36:40,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:36:40,485 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:36:40,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:36:40,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:36:40,485 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:36:40,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:36:40,486 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2024-11-14 03:36:40,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:36:40,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:36:40,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:36:40,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:36:40,807 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:36:40,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i Unable to find full path for "g++" [2024-11-14 03:36:42,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:36:43,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:36:43,078 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-11-14 03:36:43,093 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/data/c20ebea58/920c2dcca76345ed9175a0d0e8894dc5/FLAG2ea9b0ee1 [2024-11-14 03:36:43,111 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/data/c20ebea58/920c2dcca76345ed9175a0d0e8894dc5 [2024-11-14 03:36:43,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:36:43,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:36:43,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:36:43,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:36:43,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:36:43,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cf2feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43, skipping insertion in model container [2024-11-14 03:36:43,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:36:43,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:36:43,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:36:43,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:36:43,702 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:36:43,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43 WrapperNode [2024-11-14 03:36:43,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:36:43,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:36:43,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:36:43,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:36:43,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,785 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-14 03:36:43,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:36:43,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:36:43,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:36:43,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:36:43,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:36:43,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:36:43,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:36:43,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:36:43,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (1/1) ... [2024-11-14 03:36:43,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:36:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:36:43,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:36:43,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:36:43,918 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-14 03:36:43,918 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-14 03:36:43,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:36:43,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-14 03:36:43,919 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-14 03:36:43,919 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-14 03:36:43,919 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-14 03:36:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:36:43,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:36:44,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:36:44,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:36:44,615 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-14 03:36:44,615 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:36:44,720 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:36:44,720 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-14 03:36:44,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:36:44 BoogieIcfgContainer [2024-11-14 03:36:44,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:36:44,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:36:44,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:36:44,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:36:44,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:36:43" (1/3) ... [2024-11-14 03:36:44,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46991e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:36:44, skipping insertion in model container [2024-11-14 03:36:44,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:36:43" (2/3) ... [2024-11-14 03:36:44,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46991e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:36:44, skipping insertion in model container [2024-11-14 03:36:44,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:36:44" (3/3) ... [2024-11-14 03:36:44,733 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2024-11-14 03:36:44,774 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:36:44,781 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_to_dll_rev-1.i that has 5 procedures, 83 locations, 1 initial locations, 21 loop locations, and 2 error locations. [2024-11-14 03:36:44,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:36:44,857 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52570227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:36:44,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 03:36:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 70 states have internal predecessors, (103), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:36:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:36:44,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:36:44,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:36:44,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 03:36:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:36:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1386338636, now seen corresponding path program 1 times [2024-11-14 03:36:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:36:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458108872] [2024-11-14 03:36:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:36:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:45,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:36:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458108872] [2024-11-14 03:36:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458108872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:36:45,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:36:45,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:36:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520885164] [2024-11-14 03:36:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:36:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:36:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:36:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:36:45,148 INFO L87 Difference]: Start difference. First operand has 83 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 70 states have internal predecessors, (103), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:36:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:36:45,226 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2024-11-14 03:36:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:36:45,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:36:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:36:45,240 INFO L225 Difference]: With dead ends: 81 [2024-11-14 03:36:45,240 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 03:36:45,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:36:45,247 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:36:45,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:36:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 03:36:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 03:36:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.293103448275862) internal successors, (75), 67 states have internal predecessors, (75), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-14 03:36:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2024-11-14 03:36:45,309 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 15 [2024-11-14 03:36:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:36:45,309 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2024-11-14 03:36:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:36:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2024-11-14 03:36:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:36:45,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:36:45,311 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:36:45,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:36:45,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 03:36:45,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:36:45,315 INFO L85 PathProgramCache]: Analyzing trace with hash -434398509, now seen corresponding path program 1 times [2024-11-14 03:36:45,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:36:45,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130396171] [2024-11-14 03:36:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:36:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:47,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:36:47,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130396171] [2024-11-14 03:36:47,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130396171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:36:47,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:36:47,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 03:36:47,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586149298] [2024-11-14 03:36:47,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:36:47,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:36:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:36:47,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:36:47,353 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 13 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:36:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:36:48,707 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2024-11-14 03:36:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:36:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-14 03:36:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:36:48,710 INFO L225 Difference]: With dead ends: 111 [2024-11-14 03:36:48,710 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 03:36:48,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:36:48,712 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 98 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:36:48,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 314 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 03:36:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 03:36:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2024-11-14 03:36:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 77 states have internal predecessors, (88), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-14 03:36:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2024-11-14 03:36:48,734 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 24 [2024-11-14 03:36:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:36:48,735 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2024-11-14 03:36:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:36:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2024-11-14 03:36:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:36:48,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:36:48,737 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:36:48,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:36:48,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 03:36:48,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:36:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1286607197, now seen corresponding path program 1 times [2024-11-14 03:36:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:36:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871054568] [2024-11-14 03:36:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:36:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:49,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:36:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871054568] [2024-11-14 03:36:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871054568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:36:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548762512] [2024-11-14 03:36:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:49,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:36:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:36:49,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:36:49,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:36:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:49,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:36:49,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:36:49,995 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:36:49,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2024-11-14 03:36:50,069 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 22 [2024-11-14 03:36:50,135 INFO L349 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2024-11-14 03:36:50,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 115 [2024-11-14 03:36:50,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2024-11-14 03:36:50,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:50,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 7 [2024-11-14 03:36:50,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:50,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 42 [2024-11-14 03:36:50,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2024-11-14 03:36:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 118 [2024-11-14 03:36:51,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 03:36:51,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 129 [2024-11-14 03:36:51,200 INFO L349 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2024-11-14 03:36:51,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 148 [2024-11-14 03:36:51,456 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2024-11-14 03:36:51,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:51,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 96 [2024-11-14 03:36:52,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 93 [2024-11-14 03:36:52,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:52,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 91 [2024-11-14 03:36:54,477 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-11-14 03:36:54,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 141 [2024-11-14 03:36:54,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:54,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 107 [2024-11-14 03:36:55,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:55,106 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:36:55,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2024-11-14 03:36:55,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 03:36:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:55,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:36:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548762512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:36:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [340623789] [2024-11-14 03:36:55,340 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:36:55,340 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:36:55,345 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:36:55,350 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:36:55,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:37:00,019 INFO L197 IcfgInterpreter]: Interpreting procedure chain_node with input of size 262 for LOIs [2024-11-14 03:37:00,175 INFO L197 IcfgInterpreter]: Interpreting procedure check_seq_next with input of size 296 for LOIs [2024-11-14 03:37:02,824 INFO L197 IcfgInterpreter]: Interpreting procedure fail with input of size 295 for LOIs [2024-11-14 03:37:04,205 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:37:47,042 WARN L286 SmtUtils]: Spent 37.68s on a formula simplification. DAG size of input: 295 DAG size of output: 290 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:37:56,330 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 262 DAG size of output: 249 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:38:43,893 WARN L286 SmtUtils]: Spent 42.35s on a formula simplification. DAG size of input: 328 DAG size of output: 319 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:39:13,983 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 211 DAG size of output: 202 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:40:08,582 WARN L286 SmtUtils]: Spent 39.79s on a formula simplification. DAG size of input: 281 DAG size of output: 276 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:41:05,129 WARN L286 SmtUtils]: Spent 42.88s on a formula simplification. DAG size of input: 287 DAG size of output: 282 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:41:57,862 WARN L286 SmtUtils]: Spent 37.92s on a formula simplification. DAG size of input: 290 DAG size of output: 285 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:43:08,504 WARN L286 SmtUtils]: Spent 49.73s on a formula simplification. DAG size of input: 306 DAG size of output: 301 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:44:13,747 WARN L286 SmtUtils]: Spent 45.20s on a formula simplification. DAG size of input: 296 DAG size of output: 291 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:45:30,488 WARN L286 SmtUtils]: Spent 55.20s on a formula simplification. DAG size of input: 304 DAG size of output: 299 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:46:49,194 WARN L286 SmtUtils]: Spent 52.72s on a formula simplification. DAG size of input: 309 DAG size of output: 304 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:48:36,101 WARN L286 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 311 DAG size of output: 306 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:48:36,105 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '612#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_53| (Array Int Int)) (|v_ULTIMATE.start_create_sll_~#list~0#1.base_22| Int) (|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5| Int)) (and (or (and (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_create_sll_~pp2#1.base_11| Int) (|v_ULTIMATE.start_create_sll_~pp1#1.base_11| Int) (|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (or (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_11| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_71| (store (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 0)))) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_55| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_55|) (= (store |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_int_85|) (= (store |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_56|) (= |v_#memory_int_54| (store |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 (select (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4)))))) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 1) 1) (exists ((|v_#length_30| (Array Int Int))) (and (= (select |v_#length_30| 1) 2) (= 19 (select |v_#length_30| 2)))) (not (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_11| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (exists ((|v_#length_31| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_6| (store |v_#length_31| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 8))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (and (= 48 (select (select |v_old(#memory_int)_AFTER_CALL_4| 1) 0)) (= (select (select |v_old(#memory_int)_AFTER_CALL_4| 1) 1) 0))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 2) 1) (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0) (= (store |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |v_old(#valid)_AFTER_CALL_6|))) (= (select (store (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_4| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 0) 0) (<= (+ (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_77|))) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_11| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_int)_AFTER_CALL_3| 1) 1) 0) (= (select (select |v_old(#memory_int)_AFTER_CALL_3| 1) 0) 48))) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_71| (store (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 0)))) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_55| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_55|) (= (store |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_int_85|) (= (store |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_56|) (= |v_#memory_int_54| (store |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 (select (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4)))))) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 1) 1) (exists ((|v_#length_30| (Array Int Int))) (and (= (select |v_#length_30| 1) 2) (= 19 (select |v_#length_30| 2)))) (not (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_11| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (exists ((|v_#length_31| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_6| (store |v_#length_31| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 8))) (exists ((|v_#memory_$Pointer$.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 2) 1) (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0) (= (store |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |v_old(#valid)_AFTER_CALL_6|))) (= (select (store (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 0) 0) (<= (+ (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_77|)))) (= (store |v_#memory_int_86| |v_ULTIMATE.start_create_sll_~pp1#1.base_11| (store (select |v_#memory_int_86| |v_ULTIMATE.start_create_sll_~pp1#1.base_11|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_6| |v_ULTIMATE.start_create_sll_~pp1#1.base_11|) 0))) |v_old(#memory_int)_AFTER_CALL_6|) (= |v_#memory_int_86| (store |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~pp2#1.base_11| (store (select |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~pp2#1.base_11|) 0 (select (select |v_#memory_int_86| |v_ULTIMATE.start_create_sll_~pp2#1.base_11|) 0)))))) (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0) (= (store |v_#valid_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |v_#valid_53|))) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |v_#memory_int_55| (store |v_#memory_int_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_55| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0)))) (= |v_#memory_int_54| (store |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 (select (select |v_#memory_int_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4)))) (= |v_#memory_int_56| (store |v_#memory_int_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0)))) (= |#memory_int| (store |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |#memory_int| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)))))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_31| (Array Int Int))) (= (store |v_#length_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 0))))) (and (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0) (= (store |v_#valid_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |v_#valid_53|))) (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_5| (Array Int Int)) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_11| Int) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp1#1.base_11| Int) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int)) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (or (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_11| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_71| (store (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 0)))) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_55| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_55|) (= (store |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_int_85|) (= (store |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_56|) (= |v_#memory_int_54| (store |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 (select (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4)))))) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 1) 1) (exists ((|v_#length_30| (Array Int Int))) (and (= (select |v_#length_30| 1) 2) (= 19 (select |v_#length_30| 2)))) (not (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0) (= (store |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |v_old(#valid)_AFTER_CALL_5|))) (exists ((|v_#length_31| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_5| (store |v_#length_31| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 8))) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_11| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int)))) (and (= 48 (select (select |v_old(#memory_int)_AFTER_CALL_4| 1) 0)) (= (select (select |v_old(#memory_int)_AFTER_CALL_4| 1) 1) 0))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 2) 1) (= (select (store (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_4| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 0) 0) (<= (+ (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_77|))) (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_11| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_int)_AFTER_CALL_3| 1) 1) 0) (= (select (select |v_old(#memory_int)_AFTER_CALL_3| 1) 0) 48))) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_71| (store (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 0)))) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_55| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_55|) (= (store |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_int_85|) (= (store |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_84| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0))) |v_#memory_int_56|) (= |v_#memory_int_54| (store |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_56| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 (select (select |v_#memory_int_54| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4)))))) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 1) 1) (exists ((|v_#length_30| (Array Int Int))) (and (= (select |v_#length_30| 1) 2) (= 19 (select |v_#length_30| 2)))) (not (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0) (= (store |v_#valid_52| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |v_old(#valid)_AFTER_CALL_5|))) (exists ((|v_#length_31| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_5| (store |v_#length_31| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 8))) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_11| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) (exists ((|v_#memory_$Pointer$.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= 0 (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|)) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 2) 1) (= (select (store (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5| 1) |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_5| 0) 0) (<= (+ (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.base_76| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_#memory_$Pointer$.base_77|)))) (= |v_#memory_int_86| (store |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~pp2#1.base_11| (store (select |v_#memory_int_85| |v_ULTIMATE.start_create_sll_~pp2#1.base_11|) 0 (select (select |v_#memory_int_86| |v_ULTIMATE.start_create_sll_~pp2#1.base_11|) 0)))) (= (store |v_#memory_int_86| |v_ULTIMATE.start_create_sll_~pp1#1.base_11| (store (select |v_#memory_int_86| |v_ULTIMATE.start_create_sll_~pp1#1.base_11|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_5| |v_ULTIMATE.start_create_sll_~pp1#1.base_11|) 0))) |v_old(#memory_int)_AFTER_CALL_5|))) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |v_#memory_int_55| (store |v_#memory_int_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_55| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0)))) (= |v_#memory_int_54| (store |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 (select (select |v_#memory_int_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4)))) (= |v_#memory_int_56| (store |v_#memory_int_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (select |v_#memory_int_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 (select (select |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0)))) (= |#memory_int| (store |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select |v_#memory_int_55| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 (select (select |#memory_int| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)))))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 0)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_31| (Array Int Int))) (= (store |v_#length_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0) (store (store (select |v_#memory_$Pointer$.offset_70| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0)) 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0))) |v_ULTIMATE.start_create_sll_~#list~0#1.base_22|) 0 0)))))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_5|) 0) 0))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) 0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_7|) 0) 0) (= (store |v_#valid_53| |v_ULTIMATE.start_create_sll_~#list~0#1.base_22| 0) |#valid|))))' at error location [2024-11-14 03:48:36,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:48:36,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:48:36,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2024-11-14 03:48:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246072446] [2024-11-14 03:48:36,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:48:36,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:48:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:48:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:48:36,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1175, Unknown=33, NotChecked=0, Total=1332 [2024-11-14 03:48:36,109 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 19 states, 10 states have (on average 2.9) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:48:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:48:41,073 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2024-11-14 03:48:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:48:41,074 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 10 states have (on average 2.9) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2024-11-14 03:48:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:48:41,075 INFO L225 Difference]: With dead ends: 115 [2024-11-14 03:48:41,075 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 03:48:41,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 696.3s TimeCoverageRelationStatistics Valid=154, Invalid=1532, Unknown=36, NotChecked=0, Total=1722 [2024-11-14 03:48:41,077 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 148 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:48:41,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 290 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 648 Invalid, 4 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 03:48:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 03:48:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 91. [2024-11-14 03:48:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 77 states have internal predecessors, (87), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-14 03:48:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-14 03:48:41,089 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 26 [2024-11-14 03:48:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:48:41,089 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-14 03:48:41,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 10 states have (on average 2.9) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:48:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-14 03:48:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:48:41,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:48:41,091 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:48:41,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 03:48:41,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:48:41,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 03:48:41,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:48:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1662132983, now seen corresponding path program 1 times [2024-11-14 03:48:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:48:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715505509] [2024-11-14 03:48:41,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:48:41,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:48:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:48:41,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:48:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:48:41,461 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:48:41,462 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:48:41,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-14 03:48:41,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-14 03:48:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:48:41,471 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-14 03:48:41,518 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:48:41,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:48:41 BoogieIcfgContainer [2024-11-14 03:48:41,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:48:41,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:48:41,525 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:48:41,525 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:48:41,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:36:44" (3/4) ... [2024-11-14 03:48:41,528 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 03:48:41,597 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 03:48:41,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:48:41,599 INFO L158 Benchmark]: Toolchain (without parser) took 718483.22ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 90.8MB in the beginning and 169.0MB in the end (delta: -78.1MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. [2024-11-14 03:48:41,599 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 83.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:48:41,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.78ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 72.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:48:41,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.11ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 70.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:48:41,604 INFO L158 Benchmark]: Boogie Preprocessor took 61.78ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 68.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:48:41,604 INFO L158 Benchmark]: RCFGBuilder took 871.95ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 39.3MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:48:41,605 INFO L158 Benchmark]: TraceAbstraction took 716800.58ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 38.8MB in the beginning and 173.2MB in the end (delta: -134.4MB). Peak memory consumption was 178.4MB. Max. memory is 16.1GB. [2024-11-14 03:48:41,605 INFO L158 Benchmark]: Witness Printer took 73.43ms. Allocated memory is still 427.8MB. Free memory was 173.2MB in the beginning and 169.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:48:41,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 83.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.78ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 72.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.11ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 70.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.78ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 68.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 871.95ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 39.3MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 716800.58ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 38.8MB in the beginning and 173.2MB in the end (delta: -134.4MB). Peak memory consumption was 178.4MB. Max. memory is 16.1GB. * Witness Printer took 73.43ms. Allocated memory is still 427.8MB. Free memory was 173.2MB in the beginning and 169.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); VAL [list={6:0}, pp1={5:0}, pp2={7:0}] [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L590] RET chain_node(&list) VAL [list={6:0}, pp1={5:0}, pp2={7:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L597] RET chain_node(&list) VAL [list={6:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L642] EXPR \read(*p1) [L642] EXPR \read(*p2) VAL [list={3:0}, p1={5:0}, p2={7:0}] [L642] CALL check_seq_next(p1, p2) VAL [\old(beg)={-1:0}, \old(end)={-1:0}] [L626] COND FALSE !(!(beg)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(!(end)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] COND TRUE !(beg) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] CALL fail() [L565] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_to_dll_rev-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 716.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 530 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1491 IncrementalHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 163 mSDtfsCounter, 1491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 696.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=2, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 44 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 87 ConstructedInterpolants, 9 QuantifiedInterpolants, 1775 SizeOfPredicates, 8 NumberOfNonLiveVariables, 281 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 03:48:41,824 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-14 03:48:41,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_493b9f6f-202a-44cf-a55d-62b18e099aa0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)