./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:19:51,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:19:51,116 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 01:19:51,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:19:51,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:19:51,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:19:51,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:19:51,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:19:51,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:19:51,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:19:51,167 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:19:51,167 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:19:51,167 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:19:51,168 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:19:51,170 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:19:51,170 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:19:51,170 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:19:51,171 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:19:51,171 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:19:51,172 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:19:51,172 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:19:51,176 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:19:51,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:19:51,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:19:51,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:19:51,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:19:51,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:19:51,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:19:51,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:19:51,178 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 01:19:51,179 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 01:19:51,179 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 01:19:51,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:19:51,180 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:19:51,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:19:51,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:19:51,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:19:51,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:19:51,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:19:51,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:19:51,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:19:51,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:19:51,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:19:51,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:19:51,185 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:19:51,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:19:51,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:19:51,186 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:19:51,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:19:51,186 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-11-09 01:19:51,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:19:51,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:19:51,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:19:51,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:19:51,535 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:19:51,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i Unable to find full path for "g++" [2024-11-09 01:19:53,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:19:53,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:19:53,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-09 01:19:53,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/data/55a6e6c02/0ed1834b77ee4ff6b951ed6b594565d8/FLAGa636d2664 [2024-11-09 01:19:54,144 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/data/55a6e6c02/0ed1834b77ee4ff6b951ed6b594565d8 [2024-11-09 01:19:54,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:19:54,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:19:54,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:54,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:19:54,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:19:54,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed06d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54, skipping insertion in model container [2024-11-09 01:19:54,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:19:54,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:54,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:19:54,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:54,788 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:19:54,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54 WrapperNode [2024-11-09 01:19:54,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:54,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:54,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:19:54,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:19:54,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,866 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-09 01:19:54,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:54,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:19:54,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:19:54,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:19:54,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:19:54,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:19:54,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:19:54,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:19:54,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:19:54,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:19:54,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:19:54,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:19:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-09 01:19:54,998 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-09 01:19:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:19:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:19:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:19:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:19:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:19:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-09 01:19:54,999 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-09 01:19:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:19:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 01:19:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-09 01:19:54,999 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-09 01:19:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:19:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-09 01:19:55,000 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-09 01:19:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:19:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:19:55,141 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:19:55,143 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:19:55,806 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2024-11-09 01:19:55,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:19:55,914 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:19:55,914 INFO L316 CfgBuilder]: Removed 28 assume(true) statements. [2024-11-09 01:19:55,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:55 BoogieIcfgContainer [2024-11-09 01:19:55,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:19:55,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:19:55,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:19:55,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:19:55,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:19:54" (1/3) ... [2024-11-09 01:19:55,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7e3583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:55, skipping insertion in model container [2024-11-09 01:19:55,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (2/3) ... [2024-11-09 01:19:55,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7e3583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:55, skipping insertion in model container [2024-11-09 01:19:55,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:55" (3/3) ... [2024-11-09 01:19:55,928 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-09 01:19:55,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:19:55,944 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-09 01:19:56,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:19:56,009 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;@bff0f63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:19:56,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-09 01:19:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 105 states have (on average 2.2095238095238097) internal successors, (232), 193 states have internal predecessors, (232), 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-09 01:19:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 01:19:56,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:56,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 01:19:56,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 548279, now seen corresponding path program 1 times [2024-11-09 01:19:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83721992] [2024-11-09 01:19:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:56,218 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-09 01:19:56,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83721992] [2024-11-09 01:19:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83721992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893518783] [2024-11-09 01:19:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:19:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:19:56,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:56,266 INFO L87 Difference]: Start difference. First operand has 207 states, 105 states have (on average 2.2095238095238097) internal successors, (232), 193 states have internal predecessors, (232), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:56,381 INFO L93 Difference]: Finished difference Result 205 states and 231 transitions. [2024-11-09 01:19:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:19:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 01:19:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:56,397 INFO L225 Difference]: With dead ends: 205 [2024-11-09 01:19:56,397 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 01:19:56,399 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-09 01:19:56,405 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:56,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:19:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 01:19:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 01:19:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 101 states have (on average 2.01980198019802) internal successors, (204), 190 states have internal predecessors, (204), 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-09 01:19:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2024-11-09 01:19:56,462 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 3 [2024-11-09 01:19:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:56,463 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2024-11-09 01:19:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2024-11-09 01:19:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 01:19:56,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:56,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 01:19:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:19:56,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 17290940, now seen corresponding path program 1 times [2024-11-09 01:19:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:56,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127376433] [2024-11-09 01:19:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:56,647 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-09 01:19:56,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127376433] [2024-11-09 01:19:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127376433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794542510] [2024-11-09 01:19:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:56,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:19:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:19:56,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:19:56,652 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:56,909 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2024-11-09 01:19:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:19:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 01:19:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:56,911 INFO L225 Difference]: With dead ends: 202 [2024-11-09 01:19:56,911 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 01:19:56,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:19:56,916 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:56,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:19:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 01:19:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-09 01:19:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 101 states have (on average 2.0) internal successors, (202), 188 states have internal predecessors, (202), 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-09 01:19:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 228 transitions. [2024-11-09 01:19:56,944 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 228 transitions. Word has length 4 [2024-11-09 01:19:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:56,945 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 228 transitions. [2024-11-09 01:19:56,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 228 transitions. [2024-11-09 01:19:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 01:19:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:56,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 01:19:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:19:56,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:56,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 17290941, now seen corresponding path program 1 times [2024-11-09 01:19:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:56,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895158290] [2024-11-09 01:19:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:57,156 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-09 01:19:57,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895158290] [2024-11-09 01:19:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895158290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:57,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:57,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056366439] [2024-11-09 01:19:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:19:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:19:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:19:57,159 INFO L87 Difference]: Start difference. First operand 202 states and 228 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:57,365 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2024-11-09 01:19:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:19:57,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 01:19:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:57,367 INFO L225 Difference]: With dead ends: 200 [2024-11-09 01:19:57,367 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 01:19:57,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:19:57,369 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:57,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 345 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:19:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 01:19:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-09 01:19:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 186 states have internal predecessors, (200), 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-09 01:19:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 226 transitions. [2024-11-09 01:19:57,381 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 226 transitions. Word has length 4 [2024-11-09 01:19:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:57,381 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 226 transitions. [2024-11-09 01:19:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2024-11-09 01:19:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 01:19:57,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:57,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 01:19:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:19:57,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -563260482, now seen corresponding path program 1 times [2024-11-09 01:19:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:57,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088273710] [2024-11-09 01:19:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:57,574 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-09 01:19:57,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:57,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088273710] [2024-11-09 01:19:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088273710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:19:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720380897] [2024-11-09 01:19:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:57,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:19:57,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:57,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:19:57,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:19:57,577 INFO L87 Difference]: Start difference. First operand 200 states and 226 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:57,869 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2024-11-09 01:19:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:19:57,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 01:19:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:57,871 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:19:57,871 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 01:19:57,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:19:57,872 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 34 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:57,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 556 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:19:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 01:19:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-09 01:19:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 101 states have (on average 1.9306930693069306) internal successors, (195), 181 states have internal predecessors, (195), 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-09 01:19:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2024-11-09 01:19:57,882 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 6 [2024-11-09 01:19:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:57,883 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2024-11-09 01:19:57,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2024-11-09 01:19:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 01:19:57,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:57,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 01:19:57,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:19:57,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:57,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash -563260481, now seen corresponding path program 1 times [2024-11-09 01:19:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829225511] [2024-11-09 01:19:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:58,204 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-09 01:19:58,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829225511] [2024-11-09 01:19:58,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829225511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:58,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:58,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:19:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479928502] [2024-11-09 01:19:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:58,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:19:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:19:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:19:58,207 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:58,583 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2024-11-09 01:19:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:19:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 01:19:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:58,585 INFO L225 Difference]: With dead ends: 190 [2024-11-09 01:19:58,585 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:19:58,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:19:58,587 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 28 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:58,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 494 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:19:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:19:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 01:19:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.881188118811881) internal successors, (190), 176 states have internal predecessors, (190), 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-09 01:19:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2024-11-09 01:19:58,596 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 6 [2024-11-09 01:19:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:58,597 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2024-11-09 01:19:58,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2024-11-09 01:19:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:19:58,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:58,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:58,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:19:58,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:58,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash -281205613, now seen corresponding path program 1 times [2024-11-09 01:19:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999753825] [2024-11-09 01:19:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:58,702 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-09 01:19:58,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999753825] [2024-11-09 01:19:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999753825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:58,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:19:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982229878] [2024-11-09 01:19:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:19:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:19:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:19:58,705 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:58,905 INFO L93 Difference]: Finished difference Result 189 states and 215 transitions. [2024-11-09 01:19:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:19:58,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 01:19:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:58,906 INFO L225 Difference]: With dead ends: 189 [2024-11-09 01:19:58,907 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 01:19:58,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:19:58,908 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:58,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 464 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:19:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 01:19:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-09 01:19:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 101 states have (on average 1.8712871287128714) internal successors, (189), 175 states have internal predecessors, (189), 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-09 01:19:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2024-11-09 01:19:58,916 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 7 [2024-11-09 01:19:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:58,916 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2024-11-09 01:19:58,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2024-11-09 01:19:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:19:58,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:58,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:58,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:19:58,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:58,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash -281205614, now seen corresponding path program 1 times [2024-11-09 01:19:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886313043] [2024-11-09 01:19:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:58,995 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-09 01:19:58,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886313043] [2024-11-09 01:19:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886313043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:19:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825271839] [2024-11-09 01:19:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:19:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:19:58,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:19:58,999 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:59,194 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2024-11-09 01:19:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:19:59,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 01:19:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:59,196 INFO L225 Difference]: With dead ends: 188 [2024-11-09 01:19:59,197 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 01:19:59,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:19:59,198 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:59,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 456 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:19:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 01:19:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 01:19:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.8613861386138615) internal successors, (188), 174 states have internal predecessors, (188), 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-09 01:19:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2024-11-09 01:19:59,218 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 7 [2024-11-09 01:19:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:59,219 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2024-11-09 01:19:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2024-11-09 01:19:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:19:59,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:59,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:59,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:19:59,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:19:59,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -35921993, now seen corresponding path program 1 times [2024-11-09 01:19:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852041578] [2024-11-09 01:19:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:59,605 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-09 01:19:59,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852041578] [2024-11-09 01:19:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852041578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:19:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849594634] [2024-11-09 01:19:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:59,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:19:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:19:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:19:59,609 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:20:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:00,279 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2024-11-09 01:20:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:20:00,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 01:20:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:00,280 INFO L225 Difference]: With dead ends: 187 [2024-11-09 01:20:00,280 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 01:20:00,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:20:00,281 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 238 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:00,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 501 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:20:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 01:20:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-09 01:20:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 101 states have (on average 1.8514851485148516) internal successors, (187), 173 states have internal predecessors, (187), 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-09 01:20:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2024-11-09 01:20:00,288 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 13 [2024-11-09 01:20:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:00,289 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2024-11-09 01:20:00,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:20:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2024-11-09 01:20:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:20:00,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:00,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:00,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:20:00,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:20:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash -35921992, now seen corresponding path program 1 times [2024-11-09 01:20:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729822226] [2024-11-09 01:20:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:00,633 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-09 01:20:00,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729822226] [2024-11-09 01:20:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729822226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:20:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584885397] [2024-11-09 01:20:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:20:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:20:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:20:00,635 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:20:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:01,215 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2024-11-09 01:20:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:20:01,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 01:20:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:01,218 INFO L225 Difference]: With dead ends: 187 [2024-11-09 01:20:01,218 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 01:20:01,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:20:01,220 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:01,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 524 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:20:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 01:20:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-09 01:20:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.8415841584158417) internal successors, (186), 172 states have internal predecessors, (186), 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-09 01:20:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2024-11-09 01:20:01,231 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 13 [2024-11-09 01:20:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:01,231 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2024-11-09 01:20:01,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:20:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2024-11-09 01:20:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:20:01,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:01,233 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:01,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:20:01,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:20:01,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1185951292, now seen corresponding path program 1 times [2024-11-09 01:20:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404096335] [2024-11-09 01:20:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:20:01,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404096335] [2024-11-09 01:20:01,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404096335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:20:01,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860716846] [2024-11-09 01:20:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:01,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:01,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:01,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:01,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:20:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:02,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:20:02,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:02,193 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:20:02,194 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 1 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 01:20:02,238 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2024-11-09 01:20:02,239 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 1 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 01:20:02,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (.cse2 (= |c_ULTIMATE.start_create_sll_~pp2#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (and .cse0 .cse1) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse2 .cse1) (and (or .cse2 .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))) is different from false [2024-11-09 01:20:02,525 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (.cse2 (= |c_ULTIMATE.start_create_sll_~pp2#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (and .cse0 .cse1) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse2 .cse1) (and (or .cse2 .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))) is different from true [2024-11-09 01:20:02,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse3 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (.cse2 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)) (or .cse0 (and .cse1 .cse2))) (and .cse3 .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse2) (and .cse1 .cse3 .cse2))) is different from false [2024-11-09 01:20:02,769 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse3 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (.cse2 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)) (or .cse0 (and .cse1 .cse2))) (and .cse3 .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse2) (and .cse1 .cse3 .cse2))) is different from true [2024-11-09 01:20:03,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and (let ((.cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse0) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse1 .cse0))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from false [2024-11-09 01:20:05,966 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and (let ((.cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse0) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse1 .cse0))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from true [2024-11-09 01:20:06,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and (let ((.cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 .cse1))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from false [2024-11-09 01:20:08,538 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and (let ((.cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 .cse1))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from true [2024-11-09 01:20:09,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) .cse0) (and (let ((.cse2 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))) .cse1 .cse2) (and .cse1 .cse2) (and .cse0 .cse1))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse0) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1))) .cse0))) is different from false [2024-11-09 01:20:09,697 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) .cse0) (and (let ((.cse2 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))) .cse1 .cse2) (and .cse1 .cse2) (and .cse0 .cse1))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse0) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1)))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_15| Int) (|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |v_ULTIMATE.start_create_sll_~pp2#1.base_15|) 1))) .cse0))) is different from true [2024-11-09 01:20:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:20:09,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:20:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860716846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:09,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:20:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 17 [2024-11-09 01:20:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645172812] [2024-11-09 01:20:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:20:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:20:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=142, Unknown=10, NotChecked=140, Total=342 [2024-11-09 01:20:09,706 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 01:20:09,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_create_sll_~pp2#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (let ((.cse0 (or .cse3 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and .cse0 (let ((.cse2 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))))) (or (and .cse1 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse3 .cse2) (and .cse0 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))))))) is different from false [2024-11-09 01:20:09,876 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_create_sll_~pp2#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (let ((.cse0 (or .cse3 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and .cse0 (let ((.cse2 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1))))) (or (and .cse1 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse3 .cse2) (and .cse0 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))))))) is different from true [2024-11-09 01:20:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:10,707 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2024-11-09 01:20:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:20:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-09 01:20:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:10,709 INFO L225 Difference]: With dead ends: 200 [2024-11-09 01:20:10,709 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 01:20:10,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=74, Invalid=210, Unknown=12, NotChecked=210, Total=506 [2024-11-09 01:20:10,710 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 123 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1216 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:10,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 427 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 480 Invalid, 0 Unknown, 1216 Unchecked, 0.8s Time] [2024-11-09 01:20:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 01:20:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 196. [2024-11-09 01:20:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.8073394495412844) internal successors, (197), 180 states have internal predecessors, (197), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:20:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2024-11-09 01:20:10,718 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 25 [2024-11-09 01:20:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:10,718 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2024-11-09 01:20:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 01:20:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2024-11-09 01:20:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:20:10,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:10,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:10,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:20:10,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:10,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:20:10,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1185951291, now seen corresponding path program 1 times [2024-11-09 01:20:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255278854] [2024-11-09 01:20:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:20:12,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:12,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255278854] [2024-11-09 01:20:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255278854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:20:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86559927] [2024-11-09 01:20:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:12,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:12,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:12,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:20:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:12,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 01:20:12,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:12,388 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:20:12,389 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 01:20:12,405 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 9 treesize of output 11 [2024-11-09 01:20:12,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:12,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2024-11-09 01:20:12,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:12,476 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:20:12,477 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 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-09 01:20:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:12,534 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 12 treesize of output 11 [2024-11-09 01:20:12,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:20:12,574 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:20:12,574 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 1 case distinctions, treesize of input 17 treesize of output 18 [2024-11-09 01:20:12,878 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2024-11-09 01:20:12,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 128 [2024-11-09 01:20:12,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:12,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 115 [2024-11-09 01:20:13,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:14,024 INFO L349 Elim1Store]: treesize reduction 4, result has 94.5 percent of original size [2024-11-09 01:20:14,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 104 treesize of output 158 [2024-11-09 01:20:14,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:14,124 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-09 01:20:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 95 treesize of output 109 [2024-11-09 01:20:17,321 INFO L349 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2024-11-09 01:20:17,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 129 [2024-11-09 01:20:17,342 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 5 treesize of output 3 [2024-11-09 01:20:17,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:17,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:20:17,908 INFO L349 Elim1Store]: treesize reduction 92, result has 36.1 percent of original size [2024-11-09 01:20:17,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 76 treesize of output 115 [2024-11-09 01:20:17,933 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:20:17,934 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 11 treesize of output 11 [2024-11-09 01:20:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:20:19,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86559927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:20:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1368405819] [2024-11-09 01:20:19,349 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 01:20:19,349 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:20:19,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:20:19,359 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:20:19,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:20:23,404 INFO L197 IcfgInterpreter]: Interpreting procedure chain_node with input of size 257 for LOIs [2024-11-09 01:20:24,730 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:21:00,055 WARN L286 SmtUtils]: Spent 30.70s on a formula simplification. DAG size of input: 317 DAG size of output: 300 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:21:22,980 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 299 DAG size of output: 282 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:21:33,118 WARN L286 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 307 DAG size of output: 290 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:21:45,937 WARN L286 SmtUtils]: Spent 9.29s on a formula simplification. DAG size of input: 319 DAG size of output: 298 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:22:11,018 WARN L286 SmtUtils]: Spent 17.57s on a formula simplification. DAG size of input: 327 DAG size of output: 306 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:22:48,093 WARN L286 SmtUtils]: Spent 27.59s on a formula simplification. DAG size of input: 335 DAG size of output: 314 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:23:59,403 WARN L286 SmtUtils]: Spent 41.21s on a formula simplification. DAG size of input: 308 DAG size of output: 291 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:24:52,978 WARN L286 SmtUtils]: Spent 43.39s on a formula simplification. DAG size of input: 314 DAG size of output: 297 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:25:59,892 WARN L286 SmtUtils]: Spent 51.41s on a formula simplification. DAG size of input: 314 DAG size of output: 297 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:25:59,895 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4346#(and (<= 1 |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_create_sll_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#p1~0#1.offset| 0) (= |ULTIMATE.start_main_~#p2~0#1.offset| 0) (= |ULTIMATE.start_create_sll_~#list~0#1.offset| 0) (= |ULTIMATE.start_create_sll_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) (= |ULTIMATE.start_create_sll_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_create_sll_~pp1#1.base_15| Int)) (and (<= (select |#length| |v_ULTIMATE.start_create_sll_~pp1#1.base_15|) 3) (or (and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_16| Int) (|v_old(#length)_AFTER_CALL_7| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_7| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_7| (Array Int Int)) (|v_#memory_int_81| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_7| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|) 1) (or (and (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_80| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_80| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_81| (store |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_int_81| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)))) (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4)))))) (= (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_16| |ULTIMATE.start_main_~#p2~0#1.base|) (exists ((|v_#length_150| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_7| (store |v_#length_150| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 8))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_130| (store (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 0)))) (not (= (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (<= (+ (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |v_#memory_$Pointer$.base_130|)) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p2~0#1.base|) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_15| |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base|) 0) (exists ((|v_#valid_168| (Array Int Int))) (and (= (select |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0) (= (store |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |v_old(#valid)_AFTER_CALL_7|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_int)_AFTER_CALL_6| 1) 0) 48) (= (select (select |v_old(#memory_int)_AFTER_CALL_6| 1) 1) 0))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base|) 0) (exists ((|v_#memory_$Pointer$.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (exists ((|v_#length_149| (Array Int Int))) (and (= 19 (select |v_#length_149| 2)) (= (select |v_#length_149| 1) 2)))) (and (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_80| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_80| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_81| (store |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_int_81| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)))) (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4)))))) (= (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_16| |ULTIMATE.start_main_~#p2~0#1.base|) (exists ((|v_#length_150| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_7| (store |v_#length_150| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 8))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_130| (store (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 0)))) (exists ((|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_int)_AFTER_CALL_5| 1) 0) 48) (= (select (select |v_old(#memory_int)_AFTER_CALL_5| 1) 1) 0))) (not (= (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (<= (+ (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |v_#memory_$Pointer$.base_130|)) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p2~0#1.base|) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_15| |ULTIMATE.start_main_~#p1~0#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base|) 0) (exists ((|v_#valid_168| (Array Int Int))) (and (= (select |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0) (= (store |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |v_old(#valid)_AFTER_CALL_7|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p1~0#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base|) 0) (exists ((|v_#length_149| (Array Int Int))) (and (= 19 (select |v_#length_149| 2)) (= (select |v_#length_149| 1) 2))))) (<= 4 (select |v_old(#length)_AFTER_CALL_7| |ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_7| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_7| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_create_sll_~pp2#1.base_16| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_7| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|) 0))) |v_old(#memory_int)_AFTER_CALL_7|))) (exists ((|v_#valid_168| (Array Int Int))) (and (= (select |v_#valid_168| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0) (= (store |v_#valid_168| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#valid|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 (select (select |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4)))) (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= (store |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |#memory_int|) (= (store |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0))) |v_#memory_int_80|))) (exists ((|v_#length_150| (Array Int Int))) (= (store |v_#length_150| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 8) |#length|))) (and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 0)))) (exists ((|v_#valid_168| (Array Int Int))) (and (= (select |v_#valid_168| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0) (= (store |v_#valid_168| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#valid|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 (select (select |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4)))) (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_78| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= (store |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |#memory_int|) (= (store |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_79| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_80| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0))) |v_#memory_int_80|))) (exists ((|v_#length_150| (Array Int Int))) (= (store |v_#length_150| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_16| Int) (|v_old(#length)_AFTER_CALL_8| (Array Int Int)) (|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_81| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|) 1) (or (and (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_80| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_80| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_81| (store |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_int_81| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)))) (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4)))))) (= (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_16| |ULTIMATE.start_main_~#p2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_130| (store (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 0)))) (not (= (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (<= (+ (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |v_#memory_$Pointer$.base_130|)) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p2~0#1.base|) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_15| |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_#valid_168| (Array Int Int))) (and (= (select |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0) (= (store |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |v_old(#valid)_AFTER_CALL_8|))) (exists ((|v_#length_150| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_8| (store |v_#length_150| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 8))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_int)_AFTER_CALL_6| 1) 0) 48) (= (select (select |v_old(#memory_int)_AFTER_CALL_6| 1) 1) 0))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base|) 0) (exists ((|v_#memory_$Pointer$.base_BEFORE_CALL_4| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (exists ((|v_#length_149| (Array Int Int))) (and (= 19 (select |v_#length_149| 2)) (= (select |v_#length_149| 1) 2)))) (and (exists ((|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |v_#memory_int_78| (store |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_77| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_80| (store |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 (select (select |v_#memory_int_80| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0)))) (= |v_#memory_int_81| (store |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_int_81| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)))) (= |v_#memory_int_79| (store |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 (select (select |v_#memory_int_79| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4)))))) (= (select (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (= |v_ULTIMATE.start_create_sll_~pp2#1.base_16| |ULTIMATE.start_main_~#p2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_create_sll_~#list~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_130| (store (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 0)))) (exists ((|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_int)_AFTER_CALL_5| 1) 0) 48) (= (select (select |v_old(#memory_int)_AFTER_CALL_5| 1) 1) 0))) (not (= (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (<= (+ (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) (store (store (select |v_#memory_$Pointer$.base_126| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0 0) 4 0)) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |ULTIMATE.start_create_sll_~#list~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) |v_#memory_$Pointer$.base_130|)) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p2~0#1.base|) (= |v_ULTIMATE.start_create_sll_~pp1#1.base_15| |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_#valid_168| (Array Int Int))) (and (= (select |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) 0) (= (store |v_#valid_168| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 1) |v_old(#valid)_AFTER_CALL_8|))) (exists ((|v_#length_150| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_8| (store |v_#length_150| (select (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0) 8))) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#p1~0#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#p1~0#1.base| 1) |ULTIMATE.start_main_~#p2~0#1.base|) 0) (exists ((|v_#length_149| (Array Int Int))) (and (= 19 (select |v_#length_149| 2)) (= (select |v_#length_149| 1) 2))))) (<= 4 (select |v_old(#length)_AFTER_CALL_8| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|)) (<= 4 (select |v_old(#length)_AFTER_CALL_8| |ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_8| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1) (= |v_old(#memory_int)_AFTER_CALL_8| (store |v_#memory_int_81| |v_ULTIMATE.start_create_sll_~pp2#1.base_16| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_8| |v_ULTIMATE.start_create_sll_~pp2#1.base_16|) 0)))))))))) (= (select |#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1))' at error location [2024-11-09 01:25:59,896 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:25:59,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:25:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-09 01:25:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60651075] [2024-11-09 01:25:59,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:25:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:25:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:25:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:25:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1140, Unknown=21, NotChecked=0, Total=1332 [2024-11-09 01:25:59,899 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand has 19 states, 14 states have (on average 2.857142857142857) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:26:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:08,939 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2024-11-09 01:26:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:26:08,940 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.857142857142857) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2024-11-09 01:26:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:08,941 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:26:08,941 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 01:26:08,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 338.9s TimeCoverageRelationStatistics Valid=227, Invalid=1391, Unknown=22, NotChecked=0, Total=1640 [2024-11-09 01:26:08,943 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 157 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:08,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 880 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-09 01:26:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 01:26:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-09 01:26:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 109 states have (on average 1.7889908256880733) internal successors, (195), 179 states have internal predecessors, (195), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:26:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 225 transitions. [2024-11-09 01:26:08,951 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 225 transitions. Word has length 25 [2024-11-09 01:26:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:08,951 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 225 transitions. [2024-11-09 01:26:08,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.857142857142857) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:26:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 225 transitions. [2024-11-09 01:26:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 01:26:08,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:08,953 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:08,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:09,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:09,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:26:09,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash 498994629, now seen corresponding path program 1 times [2024-11-09 01:26:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:26:09,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120908453] [2024-11-09 01:26:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 01:26:11,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:26:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120908453] [2024-11-09 01:26:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120908453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:11,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202504710] [2024-11-09 01:26:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:11,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:11,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:11,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:26:11,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:26:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 01:26:11,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:11,466 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2024-11-09 01:26:11,466 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 1 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 01:26:11,572 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:26:11,573 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 1 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 01:26:11,724 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 12 treesize of output 10 [2024-11-09 01:26:11,750 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-09 01:26:11,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:26:11,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-09 01:26:12,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))) is different from false [2024-11-09 01:26:12,602 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))) is different from true [2024-11-09 01:26:13,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))) is different from false [2024-11-09 01:26:15,603 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))) is different from true [2024-11-09 01:26:15,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))) is different from false [2024-11-09 01:26:17,907 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))) is different from true [2024-11-09 01:26:18,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse0) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1))) .cse1) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and (or (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)))) .cse1) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)) .cse1) (and .cse0 .cse1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse1))) is different from false [2024-11-09 01:26:20,498 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse0) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1))) .cse1) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and (or (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)))) .cse1) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)) .cse1) (and .cse0 .cse1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse1))) is different from true [2024-11-09 01:26:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 15 not checked. [2024-11-09 01:26:20,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202504710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1415900062] [2024-11-09 01:26:22,988 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 01:26:22,988 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:26:22,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:26:22,989 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:26:22,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:26:25,874 INFO L197 IcfgInterpreter]: Interpreting procedure chain_node with input of size 271 for LOIs [2024-11-09 01:26:27,241 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:26:33,881 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 271 DAG size of output: 262 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:26:41,749 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 292 DAG size of output: 283 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:26:51,705 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 313 DAG size of output: 300 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:27:05,339 WARN L286 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 321 DAG size of output: 308 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:27:20,259 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 333 DAG size of output: 315 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:27:49,794 WARN L286 SmtUtils]: Spent 24.09s on a formula simplification. DAG size of input: 341 DAG size of output: 323 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:38,028 WARN L286 SmtUtils]: Spent 42.80s on a formula simplification. DAG size of input: 349 DAG size of output: 331 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:29:06,434 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4976#(and (<= 1 |#StackHeapBarrier|) (<= 4 (select |#length| |ULTIMATE.start_create_sll_~#list~0#1.base|)) (exists ((|v_ULTIMATE.start_create_sll_~pp1#1.base_16| Int)) (and (<= 2 |v_ULTIMATE.start_create_sll_~pp1#1.base_16|) (not (= (select |#valid| |v_ULTIMATE.start_create_sll_~pp1#1.base_16|) 1)))) (= |ULTIMATE.start_main_~#p1~0#1.offset| 0) (= |ULTIMATE.start_main_~#p2~0#1.offset| 0) (= |ULTIMATE.start_create_sll_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |ULTIMATE.start_create_sll_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) (= |ULTIMATE.start_create_sll_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|) 0)) (<= 2 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#p2~0#1.base|) (= |ULTIMATE.start_create_sll_~pp1#1.offset| 0))' at error location [2024-11-09 01:29:06,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:29:06,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-09 01:29:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103538038] [2024-11-09 01:29:06,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:29:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 01:29:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:06,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 01:29:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1637, Unknown=15, NotChecked=440, Total=2352 [2024-11-09 01:29:06,438 INFO L87 Difference]: Start difference. First operand 195 states and 225 transitions. Second operand has 26 states, 20 states have (on average 2.35) internal successors, (47), 23 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:29:08,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 (and .cse1 .cse2)) .cse1 (or (= |c_ULTIMATE.start_create_sll_~pp2#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|) .cse0 .cse2) .cse2 (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and (or .cse2 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))))) is different from false [2024-11-09 01:29:08,281 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 (and .cse1 .cse2)) .cse1 (or (= |c_ULTIMATE.start_create_sll_~pp2#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|) .cse0 .cse2) .cse2 (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and (or .cse2 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))))) is different from true [2024-11-09 01:29:08,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 .cse1) (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and (or .cse1 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))))) is different from false [2024-11-09 01:29:08,296 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 .cse1) (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and (or .cse1 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))))) is different from true [2024-11-09 01:29:08,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 .cse1) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) .cse1 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))))) is different from false [2024-11-09 01:29:08,993 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 .cse1) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) .cse1 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))))) is different from true [2024-11-09 01:29:09,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 .cse1) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) .cse1 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))))) is different from false [2024-11-09 01:29:09,413 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (and (or .cse0 .cse1) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (and (or (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) .cse1 (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))))) is different from true [2024-11-09 01:29:09,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse1) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1))) .cse0) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and (or (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)))) .cse0) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)) .cse0) (and .cse1 .cse0)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse0))))) is different from false [2024-11-09 01:29:09,616 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse1) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1))) .cse0) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_11| |chain_node_~node~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and (or (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)))) .cse0) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)) .cse0) (and .cse1 .cse0)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_11| (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |v_old(#valid)_AFTER_CALL_11| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_11|) 1)))) .cse0))))) is different from true [2024-11-09 01:29:14,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (let ((.cse0 (or (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and .cse0 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))))) is different from false [2024-11-09 01:29:14,773 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (let ((.cse0 (or (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int)) (= (select |c_#valid| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1)))))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse1 (exists ((|v_ULTIMATE.start_create_sll_~pp2#1.base_17| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_10| |v_ULTIMATE.start_create_sll_~pp2#1.base_17|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_10| (@diff |v_old(#valid)_AFTER_CALL_10| |c_#valid|) 1))))) (and .cse0 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))))) is different from true [2024-11-09 01:29:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:16,169 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2024-11-09 01:29:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 01:29:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.35) internal successors, (47), 23 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-09 01:29:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:16,172 INFO L225 Difference]: With dead ends: 210 [2024-11-09 01:29:16,172 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 01:29:16,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 171.3s TimeCoverageRelationStatistics Valid=359, Invalid=2108, Unknown=27, NotChecked=1166, Total=3660 [2024-11-09 01:29:16,175 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 138 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1344 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:16,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1047 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1723 Invalid, 0 Unknown, 1344 Unchecked, 7.2s Time] [2024-11-09 01:29:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 01:29:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 184. [2024-11-09 01:29:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 101 states have (on average 1.8217821782178218) internal successors, (184), 170 states have internal predecessors, (184), 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-09 01:29:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2024-11-09 01:29:16,191 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 35 [2024-11-09 01:29:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:16,191 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2024-11-09 01:29:16,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.35) internal successors, (47), 23 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 01:29:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2024-11-09 01:29:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:29:16,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:16,192 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:16,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:29:16,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 01:29:16,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:29:16,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1223825463, now seen corresponding path program 1 times [2024-11-09 01:29:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540835697] [2024-11-09 01:29:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:29:17,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540835697] [2024-11-09 01:29:17,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540835697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:17,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:17,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:29:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362538588] [2024-11-09 01:29:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:17,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:29:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:29:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:29:17,212 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:29:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:20,066 INFO L93 Difference]: Finished difference Result 186 states and 220 transitions. [2024-11-09 01:29:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:29:20,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-09 01:29:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:20,068 INFO L225 Difference]: With dead ends: 186 [2024-11-09 01:29:20,068 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 01:29:20,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:29:20,069 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 187 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:20,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 267 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 01:29:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 01:29:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-09 01:29:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 163 states have internal predecessors, (179), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:29:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2024-11-09 01:29:20,076 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 38 [2024-11-09 01:29:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:20,076 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2024-11-09 01:29:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:29:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2024-11-09 01:29:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:29:20,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:20,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:20,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:29:20,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:29:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1223825462, now seen corresponding path program 1 times [2024-11-09 01:29:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916530027] [2024-11-09 01:29:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 01:29:20,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:20,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916530027] [2024-11-09 01:29:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916530027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:20,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:20,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:29:20,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698179611] [2024-11-09 01:29:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:29:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:29:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:29:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:29:20,799 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:29:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:23,413 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2024-11-09 01:29:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:29:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-09 01:29:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:23,416 INFO L225 Difference]: With dead ends: 189 [2024-11-09 01:29:23,416 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 01:29:23,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:29:23,417 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 163 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:23,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 328 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 01:29:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 01:29:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2024-11-09 01:29:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 106 states have (on average 1.669811320754717) internal successors, (177), 162 states have internal predecessors, (177), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:29:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2024-11-09 01:29:23,426 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 38 [2024-11-09 01:29:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:23,426 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2024-11-09 01:29:23,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:29:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2024-11-09 01:29:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 01:29:23,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:23,428 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:23,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:29:23,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 01:29:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -716116115, now seen corresponding path program 1 times [2024-11-09 01:29:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:29:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59534924] [2024-11-09 01:29:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:29:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:29:24,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:29:24,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59534924] [2024-11-09 01:29:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59534924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780947458] [2024-11-09 01:29:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:29:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:29:24,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:29:24,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97576f86-4370-49eb-ad4b-23843da450c9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:29:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:24,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:29:24,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:24,942 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 98 treesize of output 94 [2024-11-09 01:29:25,126 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 5 treesize of output 3 [2024-11-09 01:29:25,202 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| (select |c_#valid| |chain_node_~node~0#1.base|))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2024-11-09 01:29:25,376 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 01:29:25,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 01:29:25,515 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 5 treesize of output 3 [2024-11-09 01:29:25,566 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-09 01:29:25,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:29:25,698 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 14 treesize of output 9 [2024-11-09 01:29:25,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-09 01:29:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-09 01:29:25,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780947458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725648667] [2024-11-09 01:29:26,338 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 01:29:26,338 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:29:26,338 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:29:26,338 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:29:26,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:30:06,742 INFO L197 IcfgInterpreter]: Interpreting procedure chain_node with input of size 10 for LOIs [2024-11-09 01:30:06,803 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:30:08,847 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_create_sll_~#list~0#1.base_34| Int) (|v_#valid_210| (Array Int Int)) (|v_ULTIMATE.start_main_~#p2~0#1.base_31| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (and (<= 2 |v_ULTIMATE.start_main_~#p2~0#1.base_31|) (<= 2 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) (<= 4 (select |c_#length| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (= |c_#valid| (store |v_#valid_210| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#p2~0#1.base_31|) 1)) (= |c_ULTIMATE.start_main_~list~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)) (= (select |v_#valid_210| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (= .cse0 |c_ULTIMATE.start_main_~list~1#1.base|) (let ((.cse134 (+ |c_#StackHeapBarrier| 1)) (.cse135 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#p1~0#1.base| 1))) (let ((.cse1 (exists ((|v_#valid_209| (Array Int Int))) (and (= (store |v_#valid_209| .cse0 1) |v_#valid_210|) (= (select |v_#valid_209| .cse0) 0)))) (.cse2 (not (= .cse0 0))) (.cse3 (= (select |v_#valid_210| .cse0) 1)) (.cse16 (exists ((|v_#memory_$Pointer$.base_BEFORE_CALL_32| (Array Int (Array Int Int)))) (= 0 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_32| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))) (.cse18 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_32| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_32| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0) 0))) (.cse28 (exists ((|v_#memory_int_BEFORE_CALL_32| (Array Int (Array Int Int)))) (let ((.cse137 (select |v_#memory_int_BEFORE_CALL_32| 1))) (and (= (select .cse137 1) 0) (= (select .cse137 0) 48))))) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse12 (= (select .cse135 |v_ULTIMATE.start_main_~#p2~0#1.base_31|) 0)) (.cse13 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse29 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_23| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0) 0))) (.cse14 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse17 (<= .cse134 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse30 (exists ((|v_#memory_int_BEFORE_CALL_30| (Array Int (Array Int Int)))) (let ((.cse136 (select |v_#memory_int_BEFORE_CALL_30| 1))) (and (= (select .cse136 1) 0) (= 48 (select .cse136 0)))))) (.cse20 (exists ((|v_#length_173| (Array Int Int))) (and (= 2 (select |v_#length_173| 1)) (= 19 (select |v_#length_173| 2))))) (.cse23 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse24 (= (select (store .cse135 |v_ULTIMATE.start_main_~#p2~0#1.base_31| 1) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)) (.cse25 (<= .cse134 |v_ULTIMATE.start_main_~#p2~0#1.base_31|)) (.cse26 (<= .cse134 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (.cse31 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_23| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_23| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0) 0))) (.cse71 (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (.cse72 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse133 (select |v_#memory_int_134| .cse0)) (.cse132 (select |v_#memory_int_133| .cse0))) (and (= |c_#memory_int| (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |c_#memory_int| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))) (= |v_#memory_int_134| (store |v_#memory_int_133| .cse0 (store .cse132 4 (select .cse133 4)))) (= (store |v_#memory_int_134| .cse0 (store .cse133 0 (select (select |v_#memory_int_135| .cse0) 0))) |v_#memory_int_135|) (= (store |v_#memory_int_132| .cse0 (store (select |v_#memory_int_132| .cse0) 0 (select .cse132 0))) |v_#memory_int_133|))))) (.cse73 (<= 8 (select |c_#length| .cse0))) (.cse74 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (let ((.cse130 (store |v_#memory_$Pointer$.offset_181| .cse0 (let ((.cse131 (select |v_#memory_$Pointer$.offset_181| .cse0))) (store (store .cse131 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse0 (store (store .cse131 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse130 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse130 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0)))))) (.cse75 (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| .cse0 8) |c_#length|))) (.cse76 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (let ((.cse128 (store |v_#memory_$Pointer$.base_181| .cse0 (let ((.cse129 (select |v_#memory_$Pointer$.base_181| .cse0))) (store (store .cse129 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse0 (store (store .cse129 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse128 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse128 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse0))))))) (or (and .cse1 .cse2 .cse3 (exists ((|v_#memory_int_BEFORE_CALL_38| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_27| (Array Int Int)) (|v_#memory_int_137| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp1#1.base_18| Int) (|v_#memory_$Pointer$.base_186| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_137| |v_ULTIMATE.start_create_sll_~pp1#1.base_18| (store (select |v_#memory_int_137| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_38| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) 0))) |v_#memory_int_BEFORE_CALL_38|) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_27| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (<= 4 (select |v_old(#length)_AFTER_CALL_27| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|)) (let ((.cse64 (select (select |v_#memory_$Pointer$.base_186| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (let ((.cse4 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= (let ((.cse69 (store |v_#memory_$Pointer$.base_181| .cse64 (let ((.cse70 (select |v_#memory_$Pointer$.base_181| .cse64))) (store (store .cse70 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse64 (store (store .cse70 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse69 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse69 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse64))) |v_#memory_$Pointer$.base_186|))) (.cse39 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse67 (select |v_#memory_int_134| .cse64)) (.cse68 (select |v_#memory_int_133| .cse64))) (and (= (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |v_#memory_int_137| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) |v_#memory_int_137|) (= (store |v_#memory_int_134| .cse64 (store .cse67 0 (select (select |v_#memory_int_135| .cse64) 0))) |v_#memory_int_135|) (= (store |v_#memory_int_133| .cse64 (store .cse68 4 (select .cse67 4))) |v_#memory_int_134|) (= (store |v_#memory_int_132| .cse64 (store (select |v_#memory_int_132| .cse64) 0 (select .cse68 0))) |v_#memory_int_133|))))) (.cse40 (<= 8 (select |v_old(#length)_AFTER_CALL_27| .cse64))) (.cse41 (exists ((|v_#length_174| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_27| (store |v_#length_174| .cse64 8)))) (.cse42 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= (let ((.cse65 (store |v_#memory_$Pointer$.offset_181| .cse64 (let ((.cse66 (select |v_#memory_$Pointer$.offset_181| .cse64))) (store (store .cse66 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse64 (store (store .cse66 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse65 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse65 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0))) |v_#memory_$Pointer$.offset_186|))) (.cse43 (not (= .cse64 0))) (.cse22 (= |c_ULTIMATE.start_main_~#p1~0#1.base| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|)) (.cse44 (<= (+ .cse64 1) |c_#StackHeapBarrier|)) (.cse45 (= (select |v_old(#valid)_AFTER_CALL_27| .cse64) 1)) (.cse46 (exists ((|v_#valid_209| (Array Int Int))) (and (= (select |v_#valid_209| .cse64) 0) (= (store |v_#valid_209| .cse64 1) |v_old(#valid)_AFTER_CALL_27|))))) (or (and .cse4 (exists ((|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_26| (Array Int Int)) (|v_#memory_int_136| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_21| Int)) (and (<= 2 |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) (<= 4 (select |v_old(#length)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (let ((.cse32 (select (select |v_#memory_$Pointer$.base_185| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (let ((.cse6 (exists ((|v_#length_174| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_26| (store |v_#length_174| .cse32 8)))) (.cse7 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= (let ((.cse37 (store |v_#memory_$Pointer$.base_181| .cse32 (let ((.cse38 (select |v_#memory_$Pointer$.base_181| .cse32))) (store (store .cse38 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse32 (store (store .cse38 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse37 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse37 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse32))) |v_#memory_$Pointer$.base_185|))) (.cse8 (= |v_ULTIMATE.start_create_sll_~pp2#1.base_21| |v_ULTIMATE.start_main_~#p2~0#1.base_31|)) (.cse9 (<= (+ .cse32 1) |c_#StackHeapBarrier|)) (.cse10 (exists ((|v_#valid_209| (Array Int Int))) (and (= (store |v_#valid_209| .cse32 1) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_#valid_209| .cse32) 0)))) (.cse11 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_185| (let ((.cse35 (store |v_#memory_$Pointer$.offset_181| .cse32 (let ((.cse36 (select |v_#memory_$Pointer$.offset_181| .cse32))) (store (store .cse36 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse32 (store (store .cse36 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse35 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse35 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0)))))) (.cse15 (not (= .cse32 0))) (.cse19 (<= 8 (select |v_old(#length)_AFTER_CALL_26| .cse32))) (.cse21 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse33 (select |v_#memory_int_133| .cse32)) (.cse34 (select |v_#memory_int_134| .cse32))) (and (= (store |v_#memory_int_133| .cse32 (store .cse33 4 (select .cse34 4))) |v_#memory_int_134|) (= (store |v_#memory_int_132| .cse32 (store (select |v_#memory_int_132| .cse32) 0 (select .cse33 0))) |v_#memory_int_133|) (= |v_#memory_int_136| (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))) (= (store |v_#memory_int_134| .cse32 (store .cse34 0 (select (select |v_#memory_int_135| .cse32) 0))) |v_#memory_int_135|))))) (.cse27 (= (select |v_old(#valid)_AFTER_CALL_26| .cse32) 1))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 .cse17 .cse30 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse31)))) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21| (store (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 1))) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse4 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_25| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_#memory_int_136| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_21| Int)) (and (<= 2 |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) (<= 4 (select |v_old(#length)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (= |v_old(#memory_int)_AFTER_CALL_25| (store |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21| (store (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|)) (= (select |v_old(#valid)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (let ((.cse57 (select (select |v_#memory_$Pointer$.base_185| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (let ((.cse47 (exists ((|v_#length_174| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_25| (store |v_#length_174| .cse57 8)))) (.cse48 (exists ((|v_#valid_209| (Array Int Int))) (and (= (select |v_#valid_209| .cse57) 0) (= (store |v_#valid_209| .cse57 1) |v_old(#valid)_AFTER_CALL_25|)))) (.cse49 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= (let ((.cse62 (store |v_#memory_$Pointer$.base_181| .cse57 (let ((.cse63 (select |v_#memory_$Pointer$.base_181| .cse57))) (store (store .cse63 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse57 (store (store .cse63 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse62 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse62 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse57))) |v_#memory_$Pointer$.base_185|))) (.cse50 (= |v_ULTIMATE.start_create_sll_~pp2#1.base_21| |v_ULTIMATE.start_main_~#p2~0#1.base_31|)) (.cse51 (<= (+ .cse57 1) |c_#StackHeapBarrier|)) (.cse52 (<= 8 (select |v_old(#length)_AFTER_CALL_25| .cse57))) (.cse53 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_185| (let ((.cse60 (store |v_#memory_$Pointer$.offset_181| .cse57 (let ((.cse61 (select |v_#memory_$Pointer$.offset_181| .cse57))) (store (store .cse61 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse57 (store (store .cse61 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse60 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse60 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0)))))) (.cse54 (not (= .cse57 0))) (.cse55 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse58 (select |v_#memory_int_133| .cse57)) (.cse59 (select |v_#memory_int_134| .cse57))) (and (= (store |v_#memory_int_133| .cse57 (store .cse58 4 (select .cse59 4))) |v_#memory_int_134|) (= (store |v_#memory_int_132| .cse57 (store (select |v_#memory_int_132| .cse57) 0 (select .cse58 0))) |v_#memory_int_133|) (= |v_#memory_int_136| (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))) (= (store |v_#memory_int_134| .cse57 (store .cse59 0 (select (select |v_#memory_int_135| .cse57) 0))) |v_#memory_int_135|))))) (.cse56 (= (select |v_old(#valid)_AFTER_CALL_25| .cse57) 1))) (or (and .cse47 .cse48 .cse5 .cse49 .cse50 .cse51 .cse52 .cse53 .cse12 .cse13 .cse14 .cse54 .cse16 .cse17 .cse18 .cse20 .cse55 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse28) (and .cse47 .cse48 .cse5 .cse49 .cse50 .cse51 .cse52 .cse53 .cse12 .cse13 .cse29 .cse14 .cse54 .cse17 .cse30 .cse20 .cse55 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse31)))))) .cse44 .cse45 .cse46)))) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) 1) (<= 2 |v_ULTIMATE.start_create_sll_~pp1#1.base_18|))) .cse71 .cse72 .cse73 .cse74 .cse75 .cse76) (and .cse1 .cse2 .cse3 (exists ((|v_old(#length)_AFTER_CALL_28| (Array Int Int)) (|v_#memory_int_137| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_ULTIMATE.start_create_sll_~pp1#1.base_18| Int) (|v_#memory_$Pointer$.base_186| (Array Int (Array Int Int)))) (and (<= 4 (select |v_old(#length)_AFTER_CALL_28| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (= |v_old(#memory_int)_AFTER_CALL_28| (store |v_#memory_int_137| |v_ULTIMATE.start_create_sll_~pp1#1.base_18| (store (select |v_#memory_int_137| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_28| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_28| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (let ((.cse121 (select (select |v_#memory_$Pointer$.base_186| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (let ((.cse77 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= (let ((.cse126 (store |v_#memory_$Pointer$.base_181| .cse121 (let ((.cse127 (select |v_#memory_$Pointer$.base_181| .cse121))) (store (store .cse127 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse121 (store (store .cse127 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse126 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse126 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse121))) |v_#memory_$Pointer$.base_186|))) (.cse96 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse124 (select |v_#memory_int_134| .cse121)) (.cse125 (select |v_#memory_int_133| .cse121))) (and (= (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |v_#memory_int_137| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) |v_#memory_int_137|) (= (store |v_#memory_int_134| .cse121 (store .cse124 0 (select (select |v_#memory_int_135| .cse121) 0))) |v_#memory_int_135|) (= (store |v_#memory_int_133| .cse121 (store .cse125 4 (select .cse124 4))) |v_#memory_int_134|) (= (store |v_#memory_int_132| .cse121 (store (select |v_#memory_int_132| .cse121) 0 (select .cse125 0))) |v_#memory_int_133|))))) (.cse97 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= (let ((.cse122 (store |v_#memory_$Pointer$.offset_181| .cse121 (let ((.cse123 (select |v_#memory_$Pointer$.offset_181| .cse121))) (store (store .cse123 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse121 (store (store .cse123 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse122 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse122 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0))) |v_#memory_$Pointer$.offset_186|))) (.cse98 (not (= .cse121 0))) (.cse99 (exists ((|v_#length_174| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_28| (store |v_#length_174| .cse121 8)))) (.cse87 (= |c_ULTIMATE.start_main_~#p1~0#1.base| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|)) (.cse100 (<= (+ .cse121 1) |c_#StackHeapBarrier|)) (.cse101 (exists ((|v_#valid_209| (Array Int Int))) (and (= (store |v_#valid_209| .cse121 1) |v_old(#valid)_AFTER_CALL_28|) (= (select |v_#valid_209| .cse121) 0)))) (.cse102 (<= 8 (select |v_old(#length)_AFTER_CALL_28| .cse121))) (.cse103 (= (select |v_old(#valid)_AFTER_CALL_28| .cse121) 1))) (or (and .cse77 (exists ((|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_26| (Array Int Int)) (|v_#memory_int_136| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_21| Int)) (and (<= 2 |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) (<= 4 (select |v_old(#length)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (let ((.cse89 (select (select |v_#memory_$Pointer$.base_185| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (let ((.cse78 (exists ((|v_#length_174| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_26| (store |v_#length_174| .cse89 8)))) (.cse79 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= (let ((.cse94 (store |v_#memory_$Pointer$.base_181| .cse89 (let ((.cse95 (select |v_#memory_$Pointer$.base_181| .cse89))) (store (store .cse95 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse89 (store (store .cse95 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse94 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse94 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse89))) |v_#memory_$Pointer$.base_185|))) (.cse80 (= |v_ULTIMATE.start_create_sll_~pp2#1.base_21| |v_ULTIMATE.start_main_~#p2~0#1.base_31|)) (.cse81 (<= (+ .cse89 1) |c_#StackHeapBarrier|)) (.cse82 (exists ((|v_#valid_209| (Array Int Int))) (and (= (store |v_#valid_209| .cse89 1) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_#valid_209| .cse89) 0)))) (.cse83 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_185| (let ((.cse92 (store |v_#memory_$Pointer$.offset_181| .cse89 (let ((.cse93 (select |v_#memory_$Pointer$.offset_181| .cse89))) (store (store .cse93 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse89 (store (store .cse93 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse92 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse92 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0)))))) (.cse84 (not (= .cse89 0))) (.cse85 (<= 8 (select |v_old(#length)_AFTER_CALL_26| .cse89))) (.cse86 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse90 (select |v_#memory_int_133| .cse89)) (.cse91 (select |v_#memory_int_134| .cse89))) (and (= (store |v_#memory_int_133| .cse89 (store .cse90 4 (select .cse91 4))) |v_#memory_int_134|) (= (store |v_#memory_int_132| .cse89 (store (select |v_#memory_int_132| .cse89) 0 (select .cse90 0))) |v_#memory_int_133|) (= |v_#memory_int_136| (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))) (= (store |v_#memory_int_134| .cse89 (store .cse91 0 (select (select |v_#memory_int_135| .cse89) 0))) |v_#memory_int_135|))))) (.cse88 (= (select |v_old(#valid)_AFTER_CALL_26| .cse89) 1))) (or (and .cse5 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse12 .cse13 .cse14 .cse84 .cse16 .cse17 .cse18 .cse85 .cse20 .cse86 .cse87 .cse23 .cse24 .cse25 .cse26 .cse88 .cse28) (and .cse5 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse12 .cse13 .cse29 .cse14 .cse84 .cse17 .cse30 .cse85 .cse20 .cse86 .cse87 .cse23 .cse24 .cse25 .cse26 .cse88 .cse31)))) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21| (store (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 1))) .cse96 .cse97 .cse98 .cse99 .cse100 .cse101 .cse102 .cse103) (and .cse77 .cse96 .cse97 .cse98 .cse99 (exists ((|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_25| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_#memory_int_136| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_sll_~pp2#1.base_21| Int)) (and (<= 2 |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) (<= 4 (select |v_old(#length)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|)) (= |v_old(#memory_int)_AFTER_CALL_25| (store |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21| (store (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~pp2#1.base_21|)) (= (select |v_old(#valid)_AFTER_CALL_25| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 1) (let ((.cse114 (select (select |v_#memory_$Pointer$.base_185| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0))) (let ((.cse104 (exists ((|v_#length_174| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_25| (store |v_#length_174| .cse114 8)))) (.cse105 (exists ((|v_#valid_209| (Array Int Int))) (and (= (select |v_#valid_209| .cse114) 0) (= (store |v_#valid_209| .cse114 1) |v_old(#valid)_AFTER_CALL_25|)))) (.cse106 (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= (let ((.cse119 (store |v_#memory_$Pointer$.base_181| .cse114 (let ((.cse120 (select |v_#memory_$Pointer$.base_181| .cse114))) (store (store .cse120 4 0) 0 (select (select (store |v_#memory_$Pointer$.base_181| .cse114 (store (store .cse120 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse119 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse119 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 .cse114))) |v_#memory_$Pointer$.base_185|))) (.cse107 (= |v_ULTIMATE.start_create_sll_~pp2#1.base_21| |v_ULTIMATE.start_main_~#p2~0#1.base_31|)) (.cse108 (<= (+ .cse114 1) |c_#StackHeapBarrier|)) (.cse109 (<= 8 (select |v_old(#length)_AFTER_CALL_25| .cse114))) (.cse110 (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_185| (let ((.cse117 (store |v_#memory_$Pointer$.offset_181| .cse114 (let ((.cse118 (select |v_#memory_$Pointer$.offset_181| .cse114))) (store (store .cse118 4 0) 0 (select (select (store |v_#memory_$Pointer$.offset_181| .cse114 (store (store .cse118 0 0) 4 0)) |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))))) (store .cse117 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select .cse117 |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 0)))))) (.cse111 (not (= .cse114 0))) (.cse112 (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int)))) (let ((.cse115 (select |v_#memory_int_133| .cse114)) (.cse116 (select |v_#memory_int_134| .cse114))) (and (= (store |v_#memory_int_133| .cse114 (store .cse115 4 (select .cse116 4))) |v_#memory_int_134|) (= (store |v_#memory_int_132| .cse114 (store (select |v_#memory_int_132| .cse114) 0 (select .cse115 0))) |v_#memory_int_133|) (= |v_#memory_int_136| (store |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34| (store (select |v_#memory_int_135| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0 (select (select |v_#memory_int_136| |v_ULTIMATE.start_create_sll_~#list~0#1.base_34|) 0)))) (= (store |v_#memory_int_134| .cse114 (store .cse116 0 (select (select |v_#memory_int_135| .cse114) 0))) |v_#memory_int_135|))))) (.cse113 (= (select |v_old(#valid)_AFTER_CALL_25| .cse114) 1))) (or (and .cse104 .cse105 .cse5 .cse106 .cse107 .cse108 .cse109 .cse110 .cse12 .cse13 .cse14 .cse111 .cse16 .cse17 .cse18 .cse20 .cse112 .cse87 .cse23 .cse113 .cse24 .cse25 .cse26 .cse28) (and .cse104 .cse105 .cse5 .cse106 .cse107 .cse108 .cse109 .cse110 .cse12 .cse13 .cse29 .cse14 .cse111 .cse17 .cse30 .cse20 .cse112 .cse87 .cse23 .cse113 .cse24 .cse25 .cse26 .cse31)))))) .cse100 .cse101 .cse102 .cse103)))) (<= 2 |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_create_sll_~pp1#1.base_18|) 1))) .cse71 .cse72 .cse73 .cse74 .cse75 .cse76))))))) (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem21#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem21#1.offset|) (<= 1 |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#p1~0#1.base|) 1) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0)) is different from false [2024-11-09 01:31:36,300 WARN L286 SmtUtils]: Spent 57.87s on a formula simplification. DAG size of input: 308 DAG size of output: 291 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:32:48,496 WARN L286 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 314 DAG size of output: 297 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:33:55,753 WARN L286 SmtUtils]: Spent 55.93s on a formula simplification. DAG size of input: 314 DAG size of output: 297 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)