./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0237.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0237.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59c31190ccc8063bc9e40e87ef868627685497d396c28c826c00fa8abad7dfea --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:17:25,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:17:25,644 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:17:25,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:17:25,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:17:25,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:17:25,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:17:25,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:17:25,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:17:25,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:17:25,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:17:25,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:17:25,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:17:25,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:17:25,686 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:17:25,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:17:25,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:17:25,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:17:25,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:17:25,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:17:25,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:17:25,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:17:25,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:17:25,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:17:25,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:17:25,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:17:25,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:17:25,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:17:25,689 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd 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 -> Automizer 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 -> 59c31190ccc8063bc9e40e87ef868627685497d396c28c826c00fa8abad7dfea [2024-11-13 13:17:26,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:17:26,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:17:26,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:17:26,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:17:26,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:17:26,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety/test-0237.i Unable to find full path for "g++" [2024-11-13 13:17:28,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:17:28,355 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:17:28,356 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/sv-benchmarks/c/memsafety/test-0237.i [2024-11-13 13:17:28,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/data/692bd1cb9/9230c12fe99d47629de9fe76e9ae0b49/FLAG98ed3cb89 [2024-11-13 13:17:28,390 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/data/692bd1cb9/9230c12fe99d47629de9fe76e9ae0b49 [2024-11-13 13:17:28,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:17:28,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:17:28,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:17:28,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:17:28,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:17:28,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:28,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8f816d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28, skipping insertion in model container [2024-11-13 13:17:28,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:28,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:17:28,794 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 13:17:28,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:17:28,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:17:28,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:17:28,953 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:17:28,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28 WrapperNode [2024-11-13 13:17:28,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:17:28,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:17:28,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:17:28,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:17:28,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:28,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,013 INFO L138 Inliner]: procedures = 188, calls = 66, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 212 [2024-11-13 13:17:29,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:17:29,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:17:29,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:17:29,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:17:29,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,073 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [2, 4, 32]. 84 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2024-11-13 13:17:29,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:17:29,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:17:29,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:17:29,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:17:29,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (1/1) ... [2024-11-13 13:17:29,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:17:29,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:29,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:17:29,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:17:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 13:17:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2024-11-13 13:17:29,165 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:17:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:17:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:17:29,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:17:29,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:17:29,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:17:30,175 INFO L? ?]: Removed 225 outVars from TransFormulas that were not future-live. [2024-11-13 13:17:30,175 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:17:30,194 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:17:30,195 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-13 13:17:30,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:17:30 BoogieIcfgContainer [2024-11-13 13:17:30,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:17:30,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:17:30,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:17:30,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:17:30,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:17:28" (1/3) ... [2024-11-13 13:17:30,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116c5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:17:30, skipping insertion in model container [2024-11-13 13:17:30,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:28" (2/3) ... [2024-11-13 13:17:30,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116c5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:17:30, skipping insertion in model container [2024-11-13 13:17:30,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:17:30" (3/3) ... [2024-11-13 13:17:30,204 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0237.i [2024-11-13 13:17:30,219 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:17:30,222 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0237.i that has 2 procedures, 205 locations, 1 initial locations, 11 loop locations, and 87 error locations. [2024-11-13 13:17:30,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:17:30,294 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=PETRI_NET, 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;@14d514a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:17:30,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2024-11-13 13:17:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 110 states have (on average 1.990909090909091) internal successors, (219), 197 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 13:17:30,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:30,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 13:17:30,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:30,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1546086, now seen corresponding path program 1 times [2024-11-13 13:17:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274564498] [2024-11-13 13:17:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:30,462 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-13 13:17:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274564498] [2024-11-13 13:17:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274564498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:30,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:17:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916758048] [2024-11-13 13:17:30,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:30,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:17:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:17:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:17:30,509 INFO L87 Difference]: Start difference. First operand has 205 states, 110 states have (on average 1.990909090909091) internal successors, (219), 197 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-13 13:17:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:30,549 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2024-11-13 13:17:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:17:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-13 13:17:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:30,563 INFO L225 Difference]: With dead ends: 205 [2024-11-13 13:17:30,564 INFO L226 Difference]: Without dead ends: 203 [2024-11-13 13:17:30,567 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-13 13:17:30,572 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:30,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:17:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-13 13:17:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-13 13:17:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 109 states have (on average 1.889908256880734) internal successors, (206), 195 states have internal predecessors, (206), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 218 transitions. [2024-11-13 13:17:30,633 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 218 transitions. Word has length 4 [2024-11-13 13:17:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 218 transitions. [2024-11-13 13:17:30,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-13 13:17:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 218 transitions. [2024-11-13 13:17:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 13:17:30,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:30,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:17:30,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:17:30,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:30,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1481486250, now seen corresponding path program 1 times [2024-11-13 13:17:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66782503] [2024-11-13 13:17:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:30,788 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-13 13:17:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66782503] [2024-11-13 13:17:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66782503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:30,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:17:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312065184] [2024-11-13 13:17:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:30,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:17:30,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:30,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:17:30,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:17:30,791 INFO L87 Difference]: Start difference. First operand 203 states and 218 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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-13 13:17:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:31,036 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2024-11-13 13:17:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:17:31,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-13 13:17:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:31,038 INFO L225 Difference]: With dead ends: 202 [2024-11-13 13:17:31,039 INFO L226 Difference]: Without dead ends: 202 [2024-11-13 13:17:31,040 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-13 13:17:31,041 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:31,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 341 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:17:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-13 13:17:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-13 13:17:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 109 states have (on average 1.8807339449541285) internal successors, (205), 194 states have internal predecessors, (205), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2024-11-13 13:17:31,060 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 6 [2024-11-13 13:17:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:31,060 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2024-11-13 13:17:31,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-13 13:17:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2024-11-13 13:17:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 13:17:31,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:31,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:31,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:17:31,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1318566472, now seen corresponding path program 1 times [2024-11-13 13:17:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028678654] [2024-11-13 13:17:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670366022] [2024-11-13 13:17:31,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:31,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:31,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:31,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:17:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:31,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:17:31,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:31,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:17:31,382 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-13 13:17:31,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:31,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:31,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028678654] [2024-11-13 13:17:31,384 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:31,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670366022] [2024-11-13 13:17:31,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670366022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:31,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:31,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:17:31,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651417730] [2024-11-13 13:17:31,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:31,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:17:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:17:31,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:17:31,389 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 13:17:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:31,648 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2024-11-13 13:17:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:17:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 13:17:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:31,650 INFO L225 Difference]: With dead ends: 211 [2024-11-13 13:17:31,652 INFO L226 Difference]: Without dead ends: 211 [2024-11-13 13:17:31,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:17:31,653 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 11 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:31,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 562 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:17:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-13 13:17:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-13 13:17:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 117 states have (on average 1.829059829059829) internal successors, (214), 202 states have internal predecessors, (214), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2024-11-13 13:17:31,676 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 7 [2024-11-13 13:17:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:31,677 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2024-11-13 13:17:31,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 13:17:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2024-11-13 13:17:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:17:31,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:31,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:31,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:17:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-13 13:17:31,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 999587855, now seen corresponding path program 1 times [2024-11-13 13:17:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040046649] [2024-11-13 13:17:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629271799] [2024-11-13 13:17:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:31,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:31,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:31,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:31,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:17:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:32,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:17:32,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:32,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:17:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:17:32,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040046649] [2024-11-13 13:17:32,135 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629271799] [2024-11-13 13:17:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629271799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:17:32,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911087121] [2024-11-13 13:17:32,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:32,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:17:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:32,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:17:32,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:17:32,138 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:17:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:32,355 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2024-11-13 13:17:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:17:32,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-13 13:17:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:32,358 INFO L225 Difference]: With dead ends: 220 [2024-11-13 13:17:32,359 INFO L226 Difference]: Without dead ends: 220 [2024-11-13 13:17:32,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:17:32,360 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 11 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:32,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 565 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:17:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-13 13:17:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-13 13:17:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 125 states have (on average 1.784) internal successors, (223), 210 states have internal predecessors, (223), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2024-11-13 13:17:32,386 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 19 [2024-11-13 13:17:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:32,386 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2024-11-13 13:17:32,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 13:17:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2024-11-13 13:17:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 13:17:32,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:32,391 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:32,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:17:32,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:32,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:32,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1611724357, now seen corresponding path program 1 times [2024-11-13 13:17:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:32,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756598035] [2024-11-13 13:17:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942323782] [2024-11-13 13:17:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:32,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:32,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:32,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:32,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:17:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:33,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 13:17:33,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:33,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 13:17:33,186 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 13 treesize of output 9 [2024-11-13 13:17:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-13 13:17:33,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756598035] [2024-11-13 13:17:33,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942323782] [2024-11-13 13:17:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942323782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:17:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833537825] [2024-11-13 13:17:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:17:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:17:33,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:17:33,290 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 13:17:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:33,527 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2024-11-13 13:17:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:17:33,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 66 [2024-11-13 13:17:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:33,530 INFO L225 Difference]: With dead ends: 238 [2024-11-13 13:17:33,530 INFO L226 Difference]: Without dead ends: 223 [2024-11-13 13:17:33,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:17:33,531 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:33,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 765 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:17:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-13 13:17:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-13 13:17:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 128 states have (on average 1.765625) internal successors, (226), 213 states have internal predecessors, (226), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2024-11-13 13:17:33,541 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 66 [2024-11-13 13:17:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:33,541 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2024-11-13 13:17:33,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 13:17:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2024-11-13 13:17:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 13:17:33,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:33,544 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:33,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:17:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:33,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash 530497121, now seen corresponding path program 1 times [2024-11-13 13:17:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:33,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848775035] [2024-11-13 13:17:33,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:34,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286489026] [2024-11-13 13:17:34,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:34,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:34,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:34,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:34,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:17:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:34,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 13:17:34,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:34,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:17:34,655 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 13 treesize of output 9 [2024-11-13 13:17:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 13:17:34,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:17:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-13 13:17:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848775035] [2024-11-13 13:17:35,175 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286489026] [2024-11-13 13:17:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286489026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:17:35,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:17:35,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-13 13:17:35,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585184229] [2024-11-13 13:17:35,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:17:35,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:17:35,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:35,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:17:35,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:17:35,179 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:17:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:35,939 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2024-11-13 13:17:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:17:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2024-11-13 13:17:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:35,941 INFO L225 Difference]: With dead ends: 248 [2024-11-13 13:17:35,941 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 13:17:35,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:17:35,942 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 22 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:35,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1499 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:17:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 13:17:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-13 13:17:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.736842105263158) internal successors, (231), 218 states have internal predecessors, (231), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2024-11-13 13:17:35,953 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 71 [2024-11-13 13:17:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:35,953 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2024-11-13 13:17:35,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:17:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2024-11-13 13:17:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 13:17:35,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:35,956 INFO L215 NwaCegarLoop]: trace histogram [18, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:35,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:17:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:36,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:36,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 665888763, now seen corresponding path program 2 times [2024-11-13 13:17:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:36,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002365969] [2024-11-13 13:17:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:36,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451373731] [2024-11-13 13:17:36,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:17:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:36,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:36,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:17:37,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:17:37,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:17:37,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 13:17:37,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:37,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 13:17:37,399 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 13 treesize of output 9 [2024-11-13 13:17:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 149 proven. 98 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-13 13:17:37,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:17:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 133 proven. 10 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-13 13:17:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002365969] [2024-11-13 13:17:38,213 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451373731] [2024-11-13 13:17:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451373731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:17:38,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:17:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-13 13:17:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401918292] [2024-11-13 13:17:38,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:17:38,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:17:38,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:38,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:17:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:17:38,216 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:17:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:39,600 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2024-11-13 13:17:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:17:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2024-11-13 13:17:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:39,603 INFO L225 Difference]: With dead ends: 260 [2024-11-13 13:17:39,603 INFO L226 Difference]: Without dead ends: 240 [2024-11-13 13:17:39,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 13:17:39,605 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 35 mSDsluCounter, 2327 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:39,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2536 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:17:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-13 13:17:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-13 13:17:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 145 states have (on average 1.6758620689655173) internal successors, (243), 230 states have internal predecessors, (243), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 255 transitions. [2024-11-13 13:17:39,615 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 255 transitions. Word has length 84 [2024-11-13 13:17:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 255 transitions. [2024-11-13 13:17:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:17:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 255 transitions. [2024-11-13 13:17:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:17:39,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:39,618 INFO L215 NwaCegarLoop]: trace histogram [45, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:39,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:17:39,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:39,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1352314811, now seen corresponding path program 3 times [2024-11-13 13:17:39,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:39,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901875433] [2024-11-13 13:17:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957347935] [2024-11-13 13:17:40,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:17:40,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:40,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:40,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:17:40,469 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 13:17:40,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:17:40,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:17:40,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:40,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:17:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1320 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2024-11-13 13:17:40,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:17:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901875433] [2024-11-13 13:17:40,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957347935] [2024-11-13 13:17:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957347935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:17:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:17:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:17:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626112695] [2024-11-13 13:17:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:17:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:17:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:17:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:17:40,537 INFO L87 Difference]: Start difference. First operand 240 states and 255 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 13:17:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:40,735 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2024-11-13 13:17:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:17:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 111 [2024-11-13 13:17:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:40,738 INFO L225 Difference]: With dead ends: 239 [2024-11-13 13:17:40,738 INFO L226 Difference]: Without dead ends: 239 [2024-11-13 13:17:40,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:17:40,740 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:40,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 572 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:17:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-13 13:17:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-13 13:17:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 145 states have (on average 1.6689655172413793) internal successors, (242), 229 states have internal predecessors, (242), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2024-11-13 13:17:40,750 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 111 [2024-11-13 13:17:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:40,752 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2024-11-13 13:17:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 13:17:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2024-11-13 13:17:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 13:17:40,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:40,754 INFO L215 NwaCegarLoop]: trace histogram [50, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:40,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:17:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:40,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2016553784, now seen corresponding path program 1 times [2024-11-13 13:17:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992840749] [2024-11-13 13:17:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:17:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 13:17:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:17:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:42,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:17:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:17:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:17:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 719 proven. 73 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2024-11-13 13:17:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992840749] [2024-11-13 13:17:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992840749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:17:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068331011] [2024-11-13 13:17:43,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:43,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:43,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:43,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:17:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:43,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 13:17:43,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:44,098 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 13:17:44,159 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:17:44,161 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 12 treesize of output 14 [2024-11-13 13:17:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 724 proven. 1 refuted. 0 times theorem prover too weak. 863 trivial. 72 not checked. [2024-11-13 13:17:44,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:17:44,557 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:17:44,557 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 12 treesize of output 11 [2024-11-13 13:17:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 724 proven. 73 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2024-11-13 13:17:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068331011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:17:44,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:17:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 17 [2024-11-13 13:17:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329065782] [2024-11-13 13:17:44,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:17:44,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 13:17:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 13:17:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-11-13 13:17:44,597 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 13:17:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:45,465 INFO L93 Difference]: Finished difference Result 235 states and 250 transitions. [2024-11-13 13:17:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:17:45,465 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 123 [2024-11-13 13:17:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:45,467 INFO L225 Difference]: With dead ends: 235 [2024-11-13 13:17:45,467 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 13:17:45,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2024-11-13 13:17:45,468 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 19 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:45,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1284 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 802 Invalid, 0 Unknown, 204 Unchecked, 0.7s Time] [2024-11-13 13:17:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 13:17:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-13 13:17:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 145 states have (on average 1.6413793103448275) internal successors, (238), 225 states have internal predecessors, (238), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 250 transitions. [2024-11-13 13:17:45,476 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 250 transitions. Word has length 123 [2024-11-13 13:17:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:45,477 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 250 transitions. [2024-11-13 13:17:45,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 13:17:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 250 transitions. [2024-11-13 13:17:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 13:17:45,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:45,479 INFO L215 NwaCegarLoop]: trace histogram [50, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:45,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 13:17:45,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 13:17:45,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:45,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2016553785, now seen corresponding path program 1 times [2024-11-13 13:17:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528711421] [2024-11-13 13:17:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:45,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298919948] [2024-11-13 13:17:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:46,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:46,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:46,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:46,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:17:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:17:50,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-13 13:17:50,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:17:50,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:17:50,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 13 treesize of output 9 [2024-11-13 13:17:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 437 proven. 846 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-13 13:17:51,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:17:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1660 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2024-11-13 13:17:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:17:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528711421] [2024-11-13 13:17:51,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:17:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298919948] [2024-11-13 13:17:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298919948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:17:51,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:17:51,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10] total 33 [2024-11-13 13:17:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122913481] [2024-11-13 13:17:51,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:17:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 13:17:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:17:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 13:17:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 13:17:51,861 INFO L87 Difference]: Start difference. First operand 235 states and 250 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-13 13:17:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:17:54,610 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2024-11-13 13:17:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 13:17:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-13 13:17:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:17:54,614 INFO L225 Difference]: With dead ends: 269 [2024-11-13 13:17:54,614 INFO L226 Difference]: Without dead ends: 254 [2024-11-13 13:17:54,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=640, Invalid=3142, Unknown=0, NotChecked=0, Total=3782 [2024-11-13 13:17:54,617 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 4238 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:17:54,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4440 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:17:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-13 13:17:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2024-11-13 13:17:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 158 states have (on average 1.5886075949367089) internal successors, (251), 238 states have internal predecessors, (251), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:17:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2024-11-13 13:17:54,627 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 123 [2024-11-13 13:17:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:17:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2024-11-13 13:17:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-13 13:17:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2024-11-13 13:17:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 13:17:54,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:17:54,629 INFO L215 NwaCegarLoop]: trace histogram [63, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:17:54,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 13:17:54,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 13:17:54,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:17:54,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:17:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1616804881, now seen corresponding path program 2 times [2024-11-13 13:17:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:17:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947380635] [2024-11-13 13:17:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:17:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:17:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:17:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780004187] [2024-11-13 13:17:55,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:17:55,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:17:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:17:55,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:17:55,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:18:06,583 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:18:06,583 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:18:06,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-13 13:18:06,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:06,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 13:18:06,648 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 13 treesize of output 9 [2024-11-13 13:18:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1066 proven. 55 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2024-11-13 13:18:06,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:18:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 84 proven. 644 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2024-11-13 13:18:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947380635] [2024-11-13 13:18:07,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:18:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780004187] [2024-11-13 13:18:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780004187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:18:07,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:18:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-13 13:18:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968864744] [2024-11-13 13:18:07,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:18:07,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 13:18:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 13:18:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:18:07,657 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 13:18:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:09,258 INFO L93 Difference]: Finished difference Result 264 states and 282 transitions. [2024-11-13 13:18:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-13 13:18:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 136 [2024-11-13 13:18:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:09,261 INFO L225 Difference]: With dead ends: 264 [2024-11-13 13:18:09,261 INFO L226 Difference]: Without dead ends: 254 [2024-11-13 13:18:09,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=822, Invalid=3210, Unknown=0, NotChecked=0, Total=4032 [2024-11-13 13:18:09,262 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 100 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:09,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 3072 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:18:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-13 13:18:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-13 13:18:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 244 states have internal predecessors, (260), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:18:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 272 transitions. [2024-11-13 13:18:09,276 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 272 transitions. Word has length 136 [2024-11-13 13:18:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:09,276 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 272 transitions. [2024-11-13 13:18:09,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 13:18:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 272 transitions. [2024-11-13 13:18:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 13:18:09,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:09,278 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:09,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:18:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:09,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:18:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1530075759, now seen corresponding path program 3 times [2024-11-13 13:18:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587574099] [2024-11-13 13:18:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:18:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:18:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:18:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:18:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:18:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:18:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1482 proven. 319 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2024-11-13 13:18:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587574099] [2024-11-13 13:18:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587574099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764923973] [2024-11-13 13:18:14,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:18:14,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:14,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:14,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:14,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:18:14,807 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 13:18:14,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:18:14,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 13:18:14,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:14,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 13:18:14,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:18:15,520 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_calloc_model_~ptr~0#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_calloc_model_~ptr~0#1.base| (select |c_#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0))) is different from true [2024-11-13 13:18:15,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:15,682 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-13 13:18:15,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:18:15,695 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-13 13:18:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1487 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 241 not checked. [2024-11-13 13:18:15,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:18:15,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764923973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:15,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:18:15,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 35 [2024-11-13 13:18:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285623208] [2024-11-13 13:18:15,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:18:15,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 13:18:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 13:18:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1221, Unknown=1, NotChecked=70, Total=1406 [2024-11-13 13:18:15,945 INFO L87 Difference]: Start difference. First operand 254 states and 272 transitions. Second operand has 36 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 30 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 13:18:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:19,940 INFO L93 Difference]: Finished difference Result 250 states and 268 transitions. [2024-11-13 13:18:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 13:18:19,941 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 30 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 144 [2024-11-13 13:18:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:19,943 INFO L225 Difference]: With dead ends: 250 [2024-11-13 13:18:19,943 INFO L226 Difference]: Without dead ends: 250 [2024-11-13 13:18:19,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=309, Invalid=3116, Unknown=1, NotChecked=114, Total=3540 [2024-11-13 13:18:19,945 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 61 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:19,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2119 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2869 Invalid, 0 Unknown, 199 Unchecked, 2.1s Time] [2024-11-13 13:18:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-13 13:18:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-13 13:18:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 164 states have (on average 1.5609756097560976) internal successors, (256), 240 states have internal predecessors, (256), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:18:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 268 transitions. [2024-11-13 13:18:19,953 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 268 transitions. Word has length 144 [2024-11-13 13:18:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 268 transitions. [2024-11-13 13:18:19,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 30 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 13:18:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 268 transitions. [2024-11-13 13:18:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 13:18:19,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:19,955 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:19,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:18:20,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:20,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:18:20,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash -979024, now seen corresponding path program 1 times [2024-11-13 13:18:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150144571] [2024-11-13 13:18:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:18:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:18:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:18:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:18:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:18:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:18:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1097 proven. 0 refuted. 0 times theorem prover too weak. 1949 trivial. 0 not checked. [2024-11-13 13:18:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150144571] [2024-11-13 13:18:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150144571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:18:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837642332] [2024-11-13 13:18:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:21,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:18:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:21,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:18:21,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:18:21,681 INFO L87 Difference]: Start difference. First operand 250 states and 268 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:18:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:22,260 INFO L93 Difference]: Finished difference Result 249 states and 267 transitions. [2024-11-13 13:18:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:18:22,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 147 [2024-11-13 13:18:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:22,262 INFO L225 Difference]: With dead ends: 249 [2024-11-13 13:18:22,262 INFO L226 Difference]: Without dead ends: 249 [2024-11-13 13:18:22,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:18:22,263 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 9 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:22,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1149 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:18:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-13 13:18:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-11-13 13:18:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 239 states have internal predecessors, (255), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:18:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 267 transitions. [2024-11-13 13:18:22,273 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 267 transitions. Word has length 147 [2024-11-13 13:18:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:22,274 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 267 transitions. [2024-11-13 13:18:22,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:18:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 267 transitions. [2024-11-13 13:18:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 13:18:22,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:22,276 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:22,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:18:22,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:18:22,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash -979023, now seen corresponding path program 1 times [2024-11-13 13:18:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:22,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548052417] [2024-11-13 13:18:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:18:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:18:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:25,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:18:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:18:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:18:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:18:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1097 proven. 153 refuted. 0 times theorem prover too weak. 1796 trivial. 0 not checked. [2024-11-13 13:18:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548052417] [2024-11-13 13:18:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548052417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933136230] [2024-11-13 13:18:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:26,943 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:26,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:18:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:31,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-13 13:18:31,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:31,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-13 13:18:37,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:18:37,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 13:18:37,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 13:18:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1097 proven. 153 refuted. 0 times theorem prover too weak. 1796 trivial. 0 not checked. [2024-11-13 13:18:37,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:18:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1097 proven. 153 refuted. 0 times theorem prover too weak. 1796 trivial. 0 not checked. [2024-11-13 13:18:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933136230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:18:42,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:18:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2024-11-13 13:18:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901680822] [2024-11-13 13:18:42,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:18:42,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-13 13:18:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:42,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-13 13:18:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=5474, Unknown=0, NotChecked=0, Total=6320 [2024-11-13 13:18:42,608 INFO L87 Difference]: Start difference. First operand 249 states and 267 transitions. Second operand has 80 states, 79 states have (on average 1.379746835443038) internal successors, (109), 76 states have internal predecessors, (109), 1 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 13:18:46,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:18:51,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:18:55,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:00,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:04,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:08,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:13,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:17,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:21,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:26,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:30,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:34,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:39,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:43,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:47,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:19:52,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:20:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:00,959 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2024-11-13 13:20:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 13:20:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.379746835443038) internal successors, (109), 76 states have internal predecessors, (109), 1 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 1 states have call successors, (8) Word has length 147 [2024-11-13 13:20:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:00,964 INFO L225 Difference]: With dead ends: 279 [2024-11-13 13:20:00,964 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 13:20:00,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1251, Invalid=8849, Unknown=0, NotChecked=0, Total=10100 [2024-11-13 13:20:00,968 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 3572 mSolverCounterSat, 5 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3572 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:00,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4138 Invalid, 3593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3572 Invalid, 16 Unknown, 0 Unchecked, 73.4s Time] [2024-11-13 13:20:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 13:20:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 248. [2024-11-13 13:20:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 164 states have (on average 1.548780487804878) internal successors, (254), 238 states have internal predecessors, (254), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:20:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 266 transitions. [2024-11-13 13:20:00,980 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 266 transitions. Word has length 147 [2024-11-13 13:20:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:00,980 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 266 transitions. [2024-11-13 13:20:00,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 1.379746835443038) internal successors, (109), 76 states have internal predecessors, (109), 1 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 13:20:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 266 transitions. [2024-11-13 13:20:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 13:20:00,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:00,983 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:01,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:20:01,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:01,184 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:20:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 898700885, now seen corresponding path program 1 times [2024-11-13 13:20:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489606417] [2024-11-13 13:20:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:20:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:20:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:02,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:20:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:02,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:20:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:20:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:20:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1752 proven. 421 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-11-13 13:20:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:03,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489606417] [2024-11-13 13:20:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489606417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370997937] [2024-11-13 13:20:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:03,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:03,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:03,940 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:03,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:20:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:04,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 13:20:04,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:05,352 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from false [2024-11-13 13:20:05,359 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from true [2024-11-13 13:20:05,396 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-13 13:20:05,401 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-13 13:20:05,764 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-13 13:20:05,774 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-13 13:20:05,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:20:05,876 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 .cse1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2))))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= .cse3 .cse1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 13:20:05,882 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 .cse1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2))))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= .cse3 .cse1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 13:20:06,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 73 [2024-11-13 13:20:06,113 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((v_prenex_2 (Array Int Int))) (let ((.cse0 (@diff v_prenex_2 |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse0) (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (store |v_#valid_BEFORE_CALL_7| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))))) is different from false [2024-11-13 13:20:06,120 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((v_prenex_2 (Array Int Int))) (let ((.cse0 (@diff v_prenex_2 |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse0) (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|)) (.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (store |v_#valid_BEFORE_CALL_7| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))))) is different from true [2024-11-13 13:20:06,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((v_prenex_2 (Array Int Int))) (and (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) is different from false [2024-11-13 13:20:06,307 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((v_prenex_2 (Array Int Int))) (and (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) is different from true [2024-11-13 13:20:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1523 proven. 417 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2024-11-13 13:20:06,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:08,832 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:20:08,832 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 12 treesize of output 11 [2024-11-13 13:20:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1523 proven. 658 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-11-13 13:20:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370997937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:08,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:20:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 23] total 38 [2024-11-13 13:20:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647688617] [2024-11-13 13:20:08,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:08,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 13:20:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 13:20:08,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=916, Unknown=12, NotChecked=402, Total=1482 [2024-11-13 13:20:08,876 INFO L87 Difference]: Start difference. First operand 248 states and 266 transitions. Second operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 4 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-13 13:20:09,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2024-11-13 13:20:09,659 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2024-11-13 13:20:09,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2024-11-13 13:20:09,669 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2024-11-13 13:20:09,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse2))) is different from false [2024-11-13 13:20:09,710 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse2))) is different from true [2024-11-13 13:20:09,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) .cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse4 (select |c_#valid| .cse4))) (= .cse4 .cse2) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))))))) is different from false [2024-11-13 13:20:09,722 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) .cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse4 (select |c_#valid| .cse4))) (= .cse4 .cse2) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))))))) is different from true [2024-11-13 13:20:09,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) .cse0 (or (exists ((v_prenex_2 (Array Int Int))) (let ((.cse1 (@diff v_prenex_2 |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse1) (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 .cse1 (select |c_#valid| .cse1)))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|))))))) is different from false [2024-11-13 13:20:09,735 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) .cse0 (or (exists ((v_prenex_2 (Array Int Int))) (let ((.cse1 (@diff v_prenex_2 |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse1) (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 .cse1 (select |c_#valid| .cse1)))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|))))))) is different from true [2024-11-13 13:20:09,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((v_prenex_2 (Array Int Int))) (and (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 .cse2))) .cse2)) is different from false [2024-11-13 13:20:09,763 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((v_prenex_2 (Array Int Int))) (and (= (select v_prenex_2 |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 .cse2))) .cse2)) is different from true [2024-11-13 13:20:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:12,274 INFO L93 Difference]: Finished difference Result 261 states and 283 transitions. [2024-11-13 13:20:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:20:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 4 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 150 [2024-11-13 13:20:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:12,277 INFO L225 Difference]: With dead ends: 261 [2024-11-13 13:20:12,277 INFO L226 Difference]: Without dead ends: 261 [2024-11-13 13:20:12,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 285 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=232, Invalid=1198, Unknown=24, NotChecked=996, Total=2450 [2024-11-13 13:20:12,278 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 16 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 3397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1666 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:12,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2350 Invalid, 3397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1708 Invalid, 0 Unknown, 1666 Unchecked, 2.9s Time] [2024-11-13 13:20:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-13 13:20:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-13 13:20:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 249 states have internal predecessors, (267), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 13:20:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 283 transitions. [2024-11-13 13:20:12,288 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 283 transitions. Word has length 150 [2024-11-13 13:20:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:12,289 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 283 transitions. [2024-11-13 13:20:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 4 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-13 13:20:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 283 transitions. [2024-11-13 13:20:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 13:20:12,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:12,292 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:12,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:20:12,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 13:20:12,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:20:12,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 898700886, now seen corresponding path program 1 times [2024-11-13 13:20:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:12,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470043687] [2024-11-13 13:20:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:20:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:20:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:20:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:20:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:20:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:20:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1515 proven. 736 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2024-11-13 13:20:20,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:20,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470043687] [2024-11-13 13:20:20,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470043687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:20,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883925746] [2024-11-13 13:20:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:20,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:20,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:20,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:20,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:20:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:26,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-13 13:20:26,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:28,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-13 13:20:38,926 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 13:20:39,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:20:39,185 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-13 13:20:39,222 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:20:39,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:20:42,868 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 13:20:42,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 13:20:42,885 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-13 13:20:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:20:43,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-13 13:20:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1103 proven. 1046 refuted. 0 times theorem prover too weak. 326 trivial. 571 not checked. [2024-11-13 13:20:43,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883925746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:44,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 59] total 91 [2024-11-13 13:20:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970077316] [2024-11-13 13:20:44,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2024-11-13 13:20:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2024-11-13 13:20:44,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=8195, Unknown=2, NotChecked=182, Total=8742 [2024-11-13 13:20:44,327 INFO L87 Difference]: Start difference. First operand 261 states and 283 transitions. Second operand has 92 states, 89 states have (on average 1.550561797752809) internal successors, (138), 86 states have internal predecessors, (138), 5 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 13:20:48,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:21:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:02,654 INFO L93 Difference]: Finished difference Result 300 states and 332 transitions. [2024-11-13 13:21:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 13:21:02,655 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 89 states have (on average 1.550561797752809) internal successors, (138), 86 states have internal predecessors, (138), 5 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 150 [2024-11-13 13:21:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:02,656 INFO L225 Difference]: With dead ends: 300 [2024-11-13 13:21:02,656 INFO L226 Difference]: Without dead ends: 300 [2024-11-13 13:21:02,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4527 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=767, Invalid=14735, Unknown=2, NotChecked=246, Total=15750 [2024-11-13 13:21:02,660 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 146 mSDsluCounter, 5545 mSDsCounter, 0 mSdLazyCounter, 5109 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 5717 SdHoareTripleChecker+Invalid, 5370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:02,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 5717 Invalid, 5370 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 5109 Invalid, 1 Unknown, 224 Unchecked, 12.8s Time] [2024-11-13 13:21:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-13 13:21:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 240. [2024-11-13 13:21:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.5) internal successors, (246), 230 states have internal predecessors, (246), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:21:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 258 transitions. [2024-11-13 13:21:02,669 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 258 transitions. Word has length 150 [2024-11-13 13:21:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 258 transitions. [2024-11-13 13:21:02,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 89 states have (on average 1.550561797752809) internal successors, (138), 86 states have internal predecessors, (138), 5 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 13:21:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 258 transitions. [2024-11-13 13:21:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 13:21:02,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:02,671 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:02,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:21:02,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:02,872 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:21:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 863238939, now seen corresponding path program 1 times [2024-11-13 13:21:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296186627] [2024-11-13 13:21:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:21:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:04,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:21:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:21:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:21:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:21:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:21:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1670 proven. 601 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-13 13:21:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296186627] [2024-11-13 13:21:05,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296186627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133520638] [2024-11-13 13:21:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:05,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:05,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:05,678 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:05,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:21:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:06,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 13:21:06,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:06,918 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 13:21:07,022 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:21:07,022 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 12 treesize of output 14 [2024-11-13 13:21:07,170 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:21:07,170 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 12 treesize of output 14 [2024-11-13 13:21:07,430 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret7#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-13 13:21:07,434 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret7#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-13 13:21:07,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:21:07,469 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)) .cse0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-13 13:21:07,473 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)) .cse0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-13 13:21:07,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-13 13:21:07,529 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-13 13:21:07,533 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-13 13:21:07,562 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from false [2024-11-13 13:21:07,567 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from true [2024-11-13 13:21:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1205 proven. 245 refuted. 0 times theorem prover too weak. 766 trivial. 830 not checked. [2024-11-13 13:21:07,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:09,873 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:21:09,873 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 12 treesize of output 11 [2024-11-13 13:21:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1205 proven. 1075 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-13 13:21:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133520638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:21:09,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:21:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18] total 37 [2024-11-13 13:21:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069108063] [2024-11-13 13:21:09,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:09,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 13:21:09,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 13:21:09,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=934, Unknown=9, NotChecked=330, Total=1406 [2024-11-13 13:21:09,909 INFO L87 Difference]: Start difference. First operand 240 states and 258 transitions. Second operand has 38 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 31 states have internal predecessors, (127), 4 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:21:10,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret7#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0)))))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from false [2024-11-13 13:21:10,785 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret7#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse0 (select |c_#valid| .cse0)))))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from true [2024-11-13 13:21:10,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (not (= (select |c_#valid| .cse0) 1)) .cse1) (or .cse1 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= .cse0 .cse2) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse2 (select |c_#valid| .cse2))))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 13:21:10,795 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (not (= (select |c_#valid| .cse0) 1)) .cse1) (or .cse1 (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= .cse0 .cse2) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse2 (select |c_#valid| .cse2))))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 13:21:10,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (not (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|) 1)) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))) .cse0) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from false [2024-11-13 13:21:10,805 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (not (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|) 1)) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))) .cse0) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from true [2024-11-13 13:21:10,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0)) is different from false [2024-11-13 13:21:10,813 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_16|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_21| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_21| (@diff |v_#valid_BEFORE_CALL_21| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_21| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0)) is different from true [2024-11-13 13:21:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:12,982 INFO L93 Difference]: Finished difference Result 263 states and 287 transitions. [2024-11-13 13:21:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:21:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 31 states have internal predecessors, (127), 4 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) Word has length 157 [2024-11-13 13:21:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:12,984 INFO L225 Difference]: With dead ends: 263 [2024-11-13 13:21:12,984 INFO L226 Difference]: Without dead ends: 263 [2024-11-13 13:21:12,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 302 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=200, Invalid=1225, Unknown=17, NotChecked=720, Total=2162 [2024-11-13 13:21:12,985 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 3591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1600 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:12,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2520 Invalid, 3591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1963 Invalid, 0 Unknown, 1600 Unchecked, 2.7s Time] [2024-11-13 13:21:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-13 13:21:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-13 13:21:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 185 states have (on average 1.454054054054054) internal successors, (269), 250 states have internal predecessors, (269), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:21:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 287 transitions. [2024-11-13 13:21:12,995 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 287 transitions. Word has length 157 [2024-11-13 13:21:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:12,995 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 287 transitions. [2024-11-13 13:21:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 31 states have internal predecessors, (127), 4 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:21:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 287 transitions. [2024-11-13 13:21:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 13:21:12,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:12,998 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:13,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:21:13,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 13:21:13,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:21:13,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 863238940, now seen corresponding path program 1 times [2024-11-13 13:21:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:13,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578928399] [2024-11-13 13:21:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:18,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:21:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:21:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:21:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:21:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:21:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:21:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1196 proven. 1329 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2024-11-13 13:21:22,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578928399] [2024-11-13 13:21:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578928399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:22,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840317159] [2024-11-13 13:21:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:22,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:22,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:22,570 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:22,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:21:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:27,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 253 conjuncts are in the unsatisfiable core [2024-11-13 13:21:27,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:28,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:22:32,414 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:22:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:22:32,430 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-13 13:22:33,606 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 13:22:33,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 13:22:33,647 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-13 13:22:38,200 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 13:22:38,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-13 13:22:38,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-13 13:22:38,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2024-11-13 13:22:38,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 13:22:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 663 proven. 2311 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-13 13:22:39,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:22:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840317159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:22:40,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:22:40,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 80] total 114 [2024-11-13 13:22:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50462766] [2024-11-13 13:22:40,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:40,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2024-11-13 13:22:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:40,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2024-11-13 13:22:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=13048, Unknown=12, NotChecked=0, Total=13572 [2024-11-13 13:22:40,573 INFO L87 Difference]: Start difference. First operand 263 states and 287 transitions. Second operand has 115 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 107 states have internal predecessors, (171), 6 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-13 13:22:44,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:22:58,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:23:05,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:23:09,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:23:12,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:23:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:23,435 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2024-11-13 13:23:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 13:23:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 107 states have internal predecessors, (171), 6 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 157 [2024-11-13 13:23:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:23,437 INFO L225 Difference]: With dead ends: 257 [2024-11-13 13:23:23,437 INFO L226 Difference]: Without dead ends: 257 [2024-11-13 13:23:23,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6618 ImplicationChecksByTransitivity, 84.4s TimeCoverageRelationStatistics Valid=1029, Invalid=21010, Unknown=13, NotChecked=0, Total=22052 [2024-11-13 13:23:23,440 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 115 mSDsluCounter, 6100 mSDsCounter, 0 mSdLazyCounter, 6580 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 6256 SdHoareTripleChecker+Invalid, 6604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6580 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:23,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 6256 Invalid, 6604 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6580 Invalid, 4 Unknown, 0 Unchecked, 32.5s Time] [2024-11-13 13:23:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-13 13:23:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2024-11-13 13:23:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 164 states have (on average 1.451219512195122) internal successors, (238), 222 states have internal predecessors, (238), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:23:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 250 transitions. [2024-11-13 13:23:23,450 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 250 transitions. Word has length 157 [2024-11-13 13:23:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:23,451 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 250 transitions. [2024-11-13 13:23:23,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 107 states have internal predecessors, (171), 6 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-13 13:23:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 250 transitions. [2024-11-13 13:23:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-13 13:23:23,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:23,452 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:23:23,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-13 13:23:23,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 13:23:23,653 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:23:23,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 11468556, now seen corresponding path program 1 times [2024-11-13 13:23:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925552699] [2024-11-13 13:23:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:23:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:23:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:23:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:25,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:23:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:23:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:23:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1236 proven. 781 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2024-11-13 13:23:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925552699] [2024-11-13 13:23:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925552699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:23:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092735849] [2024-11-13 13:23:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:26,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:26,514 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:26,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:23:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:27,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 13:23:27,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:27,985 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_#t~ret13#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) is different from false [2024-11-13 13:23:27,988 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_#t~ret13#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) is different from true [2024-11-13 13:23:28,011 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) is different from false [2024-11-13 13:23:28,015 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) is different from true [2024-11-13 13:23:28,036 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) is different from false [2024-11-13 13:23:28,039 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) is different from true [2024-11-13 13:23:28,270 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_81| .cse2)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) is different from false [2024-11-13 13:23:28,276 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_81| .cse2)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) is different from true [2024-11-13 13:23:28,360 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_81| .cse2)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) is different from false [2024-11-13 13:23:28,367 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_81| .cse2)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) is different from true [2024-11-13 13:23:28,457 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2024-11-13 13:23:28,463 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2024-11-13 13:23:32,775 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |c_#valid| .cse4)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_82| .cse6)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |c_#valid| .cse7)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse8) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse9 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |c_#valid| .cse9)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |c_#valid| .cse10))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2024-11-13 13:23:32,793 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |c_#valid| .cse4)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_82| .cse6)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |c_#valid| .cse7)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse8) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse9 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |c_#valid| .cse9)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |c_#valid| .cse10))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2024-11-13 13:23:34,415 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |c_#valid| .cse7)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |c_#valid| .cse9)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |c_#valid| .cse10))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2024-11-13 13:23:34,426 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |c_#valid| .cse7)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |c_#valid| .cse9)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |c_#valid| .cse10))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2024-11-13 13:23:34,512 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 13:23:34,792 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:23:34,793 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 12 treesize of output 14 [2024-11-13 13:23:38,888 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_83| .cse0)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) is different from false [2024-11-13 13:23:38,900 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_83| .cse0)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) is different from true [2024-11-13 13:23:43,153 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_83| .cse0)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) is different from false [2024-11-13 13:23:43,165 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_83| .cse0)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) is different from true [2024-11-13 13:23:47,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse2)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |v_old(#valid)_AFTER_CALL_83| .cse2)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse6)) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= 1 (select |c_#valid| .cse8)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 13:23:47,996 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse2)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |v_old(#valid)_AFTER_CALL_83| .cse2)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse6)) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= 1 (select |c_#valid| .cse8)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 13:23:52,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (select |c_#valid| .cse2) 1) (= 1 (select |c_#valid| .cse3)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2))) (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse8)) (= (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse10) 1) (= 1 (select |c_#valid| .cse11)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) is different from false [2024-11-13 13:23:52,821 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (select |c_#valid| .cse2) 1) (= 1 (select |c_#valid| .cse3)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2))) (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse7) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse8)) (= (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse10) 1) (= 1 (select |c_#valid| .cse11)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) is different from true [2024-11-13 13:23:58,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) .cse1 .cse2) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse0 .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse5)) (= (select |c_#valid| .cse6) 1) (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_82| .cse6)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse7) 1) (= 1 (select |c_#valid| .cse8)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse9) 1) (= 1 (select |c_#valid| .cse10)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse11) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse10 (select |v_old(#valid)_AFTER_CALL_83| .cse10)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse12)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse13 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse14 (select |v_old(#valid)_AFTER_CALL_81| .cse14)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse14) 1) (= (select |c_#valid| .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 13:23:58,716 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) .cse1 .cse2) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse0 .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse5)) (= (select |c_#valid| .cse6) 1) (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_82| .cse6)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse7) 1) (= 1 (select |c_#valid| .cse8)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse10 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse9) 1) (= 1 (select |c_#valid| .cse10)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse11) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse10 (select |v_old(#valid)_AFTER_CALL_83| .cse10)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse12)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse13 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse14 (select |v_old(#valid)_AFTER_CALL_81| .cse14)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse14) 1) (= (select |c_#valid| .cse13) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 13:24:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 533 proven. 532 refuted. 0 times theorem prover too weak. 1021 trivial. 960 not checked. [2024-11-13 13:24:00,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:24:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092735849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:24:01,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:24:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 38 [2024-11-13 13:24:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044098474] [2024-11-13 13:24:01,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:24:01,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 13:24:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:24:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 13:24:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=722, Unknown=27, NotChecked=938, Total=1806 [2024-11-13 13:24:01,021 INFO L87 Difference]: Start difference. First operand 232 states and 250 transitions. Second operand has 39 states, 35 states have (on average 3.057142857142857) internal successors, (107), 29 states have internal predecessors, (107), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 13:24:01,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_#t~ret13#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 13:24:01,954 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_#t~ret13#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 13:24:01,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from false [2024-11-13 13:24:01,963 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from true [2024-11-13 13:24:01,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) .cse1) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from false [2024-11-13 13:24:01,972 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) .cse1) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from true [2024-11-13 13:24:01,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 13:24:02,001 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 13:24:02,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 13:24:02,041 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0)))) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_81| .cse3)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |c_#valid| .cse4))) (= .cse4 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 13:24:02,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |c_#valid| .cse3))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse2))) is different from false [2024-11-13 13:24:02,081 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |c_#valid| .cse3))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse2))) is different from true [2024-11-13 13:24:06,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= .cse5 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse8 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |c_#valid| .cse8)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse10 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse10 (select |c_#valid| .cse10)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |c_#valid| .cse11))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse2 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) is different from false [2024-11-13 13:24:06,100 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_81| .cse4)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= .cse5 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |c_#valid| .cse5)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |c_#valid| .cse6)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse8 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |c_#valid| .cse8)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse10 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse10 (select |c_#valid| .cse10)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |c_#valid| .cse11))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse2 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) is different from true [2024-11-13 13:24:10,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse5 (select |v_old(#valid)_AFTER_CALL_82| .cse5))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse5)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |c_#valid| .cse7)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |c_#valid| .cse8)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse10 (select |c_#valid| .cse10)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |c_#valid| .cse11))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse2))) is different from false [2024-11-13 13:24:10,118 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse0 (select |c_#valid| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse5 (select |v_old(#valid)_AFTER_CALL_82| .cse5))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_81| .cse6)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse6) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse5)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |c_#valid| .cse7)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse8 (select |c_#valid| .cse8)))))) (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_82| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_82| .cse10 (select |c_#valid| .cse10)))))) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |c_#valid| .cse11))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse12) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse2))) is different from true [2024-11-13 13:24:14,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |v_old(#valid)_AFTER_CALL_83| .cse2)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse5 (select |v_old(#valid)_AFTER_CALL_82| .cse5))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_81| .cse9)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse10)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse12)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0)))) is different from false [2024-11-13 13:24:14,138 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |v_old(#valid)_AFTER_CALL_83| .cse2)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse5 (select |v_old(#valid)_AFTER_CALL_82| .cse5))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_81| .cse9)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse9) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse10)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse12)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0)))) is different from true [2024-11-13 13:24:18,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_83| .cse0)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse12)) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse12))) is different from false [2024-11-13 13:24:18,163 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_83| .cse0)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse2 (select |v_old(#valid)_AFTER_CALL_82| .cse2)) |v_old(#valid)_AFTER_CALL_82|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse3 (select |v_old(#valid)_AFTER_CALL_83| .cse3)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_82| .cse4))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_81| .cse8)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (exists ((|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|))) (and (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse9 (select |v_old(#valid)_AFTER_CALL_82| .cse9))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_81| .cse10)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse9)))) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse12)) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse12))) is different from true [2024-11-13 13:24:22,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse2)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |v_old(#valid)_AFTER_CALL_83| .cse2)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse5) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse7)) (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= 1 (select |c_#valid| .cse9)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= .cse12 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_81| .cse13)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5))) is different from false [2024-11-13 13:24:22,183 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse1 (select |v_old(#valid)_AFTER_CALL_83| .cse1)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse2)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse2 (select |v_old(#valid)_AFTER_CALL_83| .cse2)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse5) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse7)) (= (store |v_#valid_BEFORE_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse7 (select |v_old(#valid)_AFTER_CALL_83| .cse7)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= 1 (select |c_#valid| .cse9)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_32| .cse11 (select |v_old(#valid)_AFTER_CALL_81| .cse11)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= .cse12 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_81| .cse13)) |v_old(#valid)_AFTER_CALL_81|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5))) is different from true [2024-11-13 13:24:26,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse1 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (select |c_#valid| .cse3) 1) (= 1 (select |c_#valid| .cse4)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_81| .cse7)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse8) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse9)) (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse11) 1) (= 1 (select |c_#valid| .cse12)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |v_old(#valid)_AFTER_CALL_82| .cse11))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse14)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 13:24:26,203 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse1 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (select |c_#valid| .cse3) 1) (= 1 (select |c_#valid| .cse4)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_81| .cse7)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse8) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse9)) (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse11) 1) (= 1 (select |c_#valid| .cse12)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |v_old(#valid)_AFTER_CALL_82| .cse11))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse14)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 13:24:30,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse1 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (select |c_#valid| .cse3) 1) (= 1 (select |c_#valid| .cse4)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_81| .cse7)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse8) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse9)) (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse11) 1) (= 1 (select |c_#valid| .cse12)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |v_old(#valid)_AFTER_CALL_82| .cse11))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse14)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from false [2024-11-13 13:24:30,225 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse1 .cse2) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (select |c_#valid| .cse3) 1) (= 1 (select |c_#valid| .cse4)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse3 (select |v_old(#valid)_AFTER_CALL_82| .cse3))) (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_81| .cse5)) |v_old(#valid)_AFTER_CALL_81|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_81| .cse7)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_83| .cse8)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse8) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|))) (and (= 1 (select |c_#valid| .cse9)) (= (store |v_#valid_BEFORE_CALL_32| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse11) 1) (= 1 (select |c_#valid| .cse12)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse11 (select |v_old(#valid)_AFTER_CALL_82| .cse11))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse12 (select |v_old(#valid)_AFTER_CALL_83| .cse12)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| .cse13) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse14)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from true [2024-11-13 13:24:34,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse1 .cse2 .cse3) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse0 .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|)) (.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse6)) (= (select |c_#valid| .cse7) 1) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse8) 1) (= 1 (select |c_#valid| .cse9)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse10) 1) (= 1 (select |c_#valid| .cse11)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse12) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse15 (select |v_old(#valid)_AFTER_CALL_81| .cse15)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse15) 1) (= (select |c_#valid| .cse14) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from false [2024-11-13 13:24:34,250 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse1 .cse2 .cse3) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse0 .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|)) (.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse6)) (= (select |c_#valid| .cse7) 1) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse8) 1) (= 1 (select |c_#valid| .cse9)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse10) 1) (= 1 (select |c_#valid| .cse11)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse12) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse15 (select |v_old(#valid)_AFTER_CALL_81| .cse15)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse15) 1) (= (select |c_#valid| .cse14) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse1))) is different from true [2024-11-13 13:24:38,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse0 .cse2 .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1 .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|)) (.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse6)) (= (select |c_#valid| .cse7) 1) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse8) 1) (= 1 (select |c_#valid| .cse9)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse10) 1) (= 1 (select |c_#valid| .cse11)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse12) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse15 (select |v_old(#valid)_AFTER_CALL_81| .cse15)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse15) 1) (= (select |c_#valid| .cse14) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))))) is different from false [2024-11-13 13:24:38,275 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l3_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse0 .cse2 .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse4 (select |v_old(#valid)_AFTER_CALL_83| .cse4)) |v_old(#valid)_AFTER_CALL_83|) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_#valid_BEFORE_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_83| .cse5)) |v_old(#valid)_AFTER_CALL_83|) (= (select |c_#valid| .cse5) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse1 .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_82|)) (.cse6 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse6)) (= (select |c_#valid| .cse7) 1) (= (store |v_#valid_BEFORE_CALL_32| .cse7 (select |v_old(#valid)_AFTER_CALL_82| .cse7)) |v_old(#valid)_AFTER_CALL_82|) (= (store |v_old(#valid)_AFTER_CALL_82| .cse6 (select |v_old(#valid)_AFTER_CALL_83| .cse6)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) .cse2) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse9 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse8) 1) (= 1 (select |c_#valid| .cse9)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse8 (select |v_old(#valid)_AFTER_CALL_82| .cse8))) (= (select |v_old(#valid)_AFTER_CALL_81| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse9 (select |v_old(#valid)_AFTER_CALL_83| .cse9)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_82|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse11 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= (select |c_#valid| .cse10) 1) (= 1 (select |c_#valid| .cse11)) (= |v_old(#valid)_AFTER_CALL_82| (store |v_old(#valid)_AFTER_CALL_81| .cse10 (select |v_old(#valid)_AFTER_CALL_82| .cse10))) (= (store |v_#valid_BEFORE_CALL_32| .cse12 (select |v_old(#valid)_AFTER_CALL_81| .cse12)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse12) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse11 (select |v_old(#valid)_AFTER_CALL_83| .cse11)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int))) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_82| |v_old(#valid)_AFTER_CALL_83|))) (and (= 1 (select |c_#valid| .cse13)) (= (select |v_old(#valid)_AFTER_CALL_82| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_82| .cse13 (select |v_old(#valid)_AFTER_CALL_83| .cse13)) |v_old(#valid)_AFTER_CALL_83|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_old(#valid)_AFTER_CALL_81| (Array Int Int))) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_32| |v_old(#valid)_AFTER_CALL_81|)) (.cse14 (@diff |v_old(#valid)_AFTER_CALL_81| |v_old(#valid)_AFTER_CALL_83|))) (and (= (store |v_old(#valid)_AFTER_CALL_81| .cse14 (select |v_old(#valid)_AFTER_CALL_83| .cse14)) |v_old(#valid)_AFTER_CALL_83|) (= (store |v_#valid_BEFORE_CALL_32| .cse15 (select |v_old(#valid)_AFTER_CALL_81| .cse15)) |v_old(#valid)_AFTER_CALL_81|) (= (select |c_#valid| .cse15) 1) (= (select |c_#valid| .cse14) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_83| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))))) is different from true [2024-11-13 13:24:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:24:40,457 INFO L93 Difference]: Finished difference Result 265 states and 291 transitions. [2024-11-13 13:24:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:24:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.057142857142857) internal successors, (107), 29 states have internal predecessors, (107), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 164 [2024-11-13 13:24:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:24:40,459 INFO L225 Difference]: With dead ends: 265 [2024-11-13 13:24:40,459 INFO L226 Difference]: Without dead ends: 265 [2024-11-13 13:24:40,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 183 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=186, Invalid=995, Unknown=57, NotChecked=2668, Total=3906 [2024-11-13 13:24:40,460 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 18 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 5541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4003 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:24:40,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2063 Invalid, 5541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1512 Invalid, 0 Unknown, 4003 Unchecked, 2.6s Time] [2024-11-13 13:24:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-13 13:24:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-11-13 13:24:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 194 states have (on average 1.3969072164948453) internal successors, (271), 251 states have internal predecessors, (271), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-13 13:24:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 291 transitions. [2024-11-13 13:24:40,468 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 291 transitions. Word has length 164 [2024-11-13 13:24:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:24:40,469 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 291 transitions. [2024-11-13 13:24:40,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.057142857142857) internal successors, (107), 29 states have internal predecessors, (107), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 13:24:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 291 transitions. [2024-11-13 13:24:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-13 13:24:40,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:24:40,471 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:24:40,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 13:24:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:24:40,672 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:24:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:24:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 11468557, now seen corresponding path program 1 times [2024-11-13 13:24:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:24:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046349423] [2024-11-13 13:24:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:24:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:24:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:24:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:24:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:24:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:24:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:24:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:48,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:24:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 705 proven. 1746 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2024-11-13 13:24:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:24:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046349423] [2024-11-13 13:24:48,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046349423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:24:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658668207] [2024-11-13 13:24:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:24:48,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:24:48,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:24:48,396 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:24:48,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:24:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:52,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 204 conjuncts are in the unsatisfiable core [2024-11-13 13:24:52,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:24:52,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-13 13:24:58,865 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:24:58,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:24:58,881 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-13 13:24:59,878 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:24:59,878 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:24:59,958 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 13:24:59,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 13:25:01,022 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:25:01,022 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:25:01,141 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-11-13 13:25:01,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-11-13 13:25:05,488 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-13 13:25:05,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2024-11-13 13:25:05,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-13 13:25:05,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:25:06,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 13 [2024-11-13 13:25:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 533 proven. 1713 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-13 13:25:06,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:25:07,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658668207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:25:07,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:25:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 59] total 98 [2024-11-13 13:25:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18704509] [2024-11-13 13:25:07,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:25:07,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2024-11-13 13:25:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:25:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2024-11-13 13:25:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=9670, Unknown=0, NotChecked=0, Total=10100 [2024-11-13 13:25:07,816 INFO L87 Difference]: Start difference. First operand 265 states and 291 transitions. Second operand has 99 states, 92 states have (on average 1.8478260869565217) internal successors, (170), 89 states have internal predecessors, (170), 8 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-13 13:25:12,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:25:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:25:32,999 INFO L93 Difference]: Finished difference Result 344 states and 394 transitions. [2024-11-13 13:25:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-13 13:25:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 92 states have (on average 1.8478260869565217) internal successors, (170), 89 states have internal predecessors, (170), 8 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) Word has length 164 [2024-11-13 13:25:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:25:33,002 INFO L225 Difference]: With dead ends: 344 [2024-11-13 13:25:33,002 INFO L226 Difference]: Without dead ends: 344 [2024-11-13 13:25:33,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6502 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=1093, Invalid=18929, Unknown=0, NotChecked=0, Total=20022 [2024-11-13 13:25:33,005 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 323 mSDsluCounter, 4244 mSDsCounter, 0 mSdLazyCounter, 6050 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 6111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 6050 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:25:33,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 4385 Invalid, 6111 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 6050 Invalid, 1 Unknown, 0 Unchecked, 16.9s Time] [2024-11-13 13:25:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-13 13:25:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 224. [2024-11-13 13:25:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 164 states have (on average 1.4024390243902438) internal successors, (230), 214 states have internal predecessors, (230), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:25:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2024-11-13 13:25:33,015 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 164 [2024-11-13 13:25:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:25:33,016 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2024-11-13 13:25:33,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 92 states have (on average 1.8478260869565217) internal successors, (170), 89 states have internal predecessors, (170), 8 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-13 13:25:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2024-11-13 13:25:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:25:33,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:25:33,018 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:25:33,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 13:25:33,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:25:33,222 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:25:33,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:25:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1121160562, now seen corresponding path program 1 times [2024-11-13 13:25:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:25:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609125547] [2024-11-13 13:25:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:25:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:25:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:25:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:25:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:25:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 13:25:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:25:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:36,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:25:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 948 proven. 541 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2024-11-13 13:25:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:25:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609125547] [2024-11-13 13:25:36,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609125547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:25:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40882084] [2024-11-13 13:25:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:25:36,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:25:36,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:25:36,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:25:36,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:25:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:25:38,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-13 13:25:38,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:25:38,775 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 13:25:38,862 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:25:38,862 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 12 treesize of output 14 [2024-11-13 13:25:39,069 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_#t~ret13#1.base|))))) is different from false [2024-11-13 13:25:39,073 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_#t~ret13#1.base|))))) is different from true [2024-11-13 13:25:39,096 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))) is different from false [2024-11-13 13:25:39,099 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))) is different from true [2024-11-13 13:25:39,344 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse3))))) is different from false [2024-11-13 13:25:39,351 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse3))))) is different from true [2024-11-13 13:25:39,440 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))))))) is different from false [2024-11-13 13:25:39,447 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))))))) is different from true [2024-11-13 13:25:39,537 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) is different from false [2024-11-13 13:25:39,544 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) is different from true [2024-11-13 13:25:43,888 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_old(#valid)_AFTER_CALL_94| .cse1)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |c_#valid| .cse2))) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_52| .cse4))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |c_#valid| .cse5))) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse6) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse6 (select |c_#valid| .cse6))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse7 (select |c_#valid| .cse7))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |c_#valid| .cse9))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_94| .cse10)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))))))) is different from false [2024-11-13 13:25:43,905 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_old(#valid)_AFTER_CALL_94| .cse1)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |c_#valid| .cse2))) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_52| .cse4))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |c_#valid| .cse5))) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse6) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse6 (select |c_#valid| .cse6))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse7 (select |c_#valid| .cse7))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse8 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse9) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |c_#valid| .cse9))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_94| .cse10)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))))))) is different from true [2024-11-13 13:25:48,140 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse0 (select |v_old(#valid)_AFTER_CALL_94| .cse0)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_52| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |c_#valid| .cse6))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_52| .cse8))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse8 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |c_#valid| .cse9))) (= .cse9 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse10 (select |c_#valid| .cse10))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse10) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse11 (select |c_#valid| .cse11))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) is different from false [2024-11-13 13:25:48,153 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse0 (select |v_old(#valid)_AFTER_CALL_94| .cse0)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_52| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |c_#valid| .cse6))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_52| .cse8))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse8 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |c_#valid| .cse9))) (= .cse9 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse10 (select |c_#valid| .cse10))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse10) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse11) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse11 (select |c_#valid| .cse11))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) is different from true [2024-11-13 13:25:48,466 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:25:48,466 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 12 treesize of output 14 [2024-11-13 13:25:52,647 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |v_old(#valid)_AFTER_CALL_95| .cse0)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse1 (select |v_old(#valid)_AFTER_CALL_94| .cse1)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_52| .cse2))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_94| .cse5)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse6)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse7 (select |v_old(#valid)_AFTER_CALL_95| .cse7)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse11) (= (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) is different from false [2024-11-13 13:25:52,659 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |v_old(#valid)_AFTER_CALL_95| .cse0)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse1 (select |v_old(#valid)_AFTER_CALL_94| .cse1)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_52| .cse2))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_94| .cse5)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse6)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse7 (select |v_old(#valid)_AFTER_CALL_95| .cse7)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse11) (= (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) is different from true [2024-11-13 13:25:56,924 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |v_old(#valid)_AFTER_CALL_95| .cse0)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse1 (select |v_old(#valid)_AFTER_CALL_94| .cse1)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_52| .cse2))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_94| .cse5)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse6)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse7 (select |v_old(#valid)_AFTER_CALL_95| .cse7)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse11) (= (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) is different from false [2024-11-13 13:25:56,935 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |v_old(#valid)_AFTER_CALL_95| .cse0)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse1 (select |v_old(#valid)_AFTER_CALL_94| .cse1)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_52| .cse2))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_94| .cse5)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse6)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse7 (select |v_old(#valid)_AFTER_CALL_95| .cse7)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse7)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9))) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse11) (= (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) is different from true [2024-11-13 13:26:01,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |v_old(#valid)_AFTER_CALL_95| .cse0)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (and .cse1 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse1 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse11) 1) (= .cse12 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse12 (select |v_old(#valid)_AFTER_CALL_94| .cse12)) |v_old(#valid)_AFTER_CALL_94|) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from false [2024-11-13 13:26:01,810 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse0 (select |v_old(#valid)_AFTER_CALL_95| .cse0)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)) (and .cse1 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse1 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse9) (= (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse11) 1) (= .cse12 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse12 (select |v_old(#valid)_AFTER_CALL_94| .cse12)) |v_old(#valid)_AFTER_CALL_94|) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from true [2024-11-13 13:26:06,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse2) (and .cse0 .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_52| .cse9))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse10) 1) (= .cse9 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse13 (select |v_old(#valid)_AFTER_CALL_94| .cse13)) |v_old(#valid)_AFTER_CALL_94|) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from false [2024-11-13 13:26:06,642 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse2) (and .cse0 .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_52| .cse9))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse10) 1) (= .cse9 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse13 (select |v_old(#valid)_AFTER_CALL_94| .cse13)) |v_old(#valid)_AFTER_CALL_94|) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from true [2024-11-13 13:26:14,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_52| .cse0))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_94| .cse5)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse3 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse6 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse7) (and .cse6 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_52| .cse8))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse9) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse7) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_old(#valid)_AFTER_CALL_94| .cse11)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| .cse11) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse6 .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_50| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse3 .cse6 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse14 (select |v_old(#valid)_AFTER_CALL_95| .cse14))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) is different from false [2024-11-13 13:26:14,440 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1))) (.cse6 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_52| .cse0))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_94| .cse5)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse3 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse6 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) .cse7) (and .cse6 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_52| .cse8))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse9) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse3 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse7) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_old(#valid)_AFTER_CALL_94| .cse11)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| .cse11) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse6 .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse13) 1) (= (store |v_#valid_BEFORE_CALL_50| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse3 .cse6 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse14 (select |v_old(#valid)_AFTER_CALL_95| .cse14))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))) is different from true [2024-11-13 13:26:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 5 proven. 302 refuted. 0 times theorem prover too weak. 1265 trivial. 1474 not checked. [2024-11-13 13:26:16,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:26:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40882084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:26:17,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:26:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 40 [2024-11-13 13:26:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840121314] [2024-11-13 13:26:17,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:26:17,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 13:26:17,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:26:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 13:26:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=887, Unknown=25, NotChecked=936, Total=1980 [2024-11-13 13:26:17,061 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand has 41 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 30 states have internal predecessors, (118), 9 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-13 13:26:17,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l0_insert_~item~4#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_#t~ret13#1.base|))))))) is different from false [2024-11-13 13:26:17,942 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l0_insert_~item~4#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_#t~ret13#1.base|))))))) is different from true [2024-11-13 13:26:17,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))) (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)))) is different from false [2024-11-13 13:26:17,953 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))) (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)))) is different from true [2024-11-13 13:26:17,989 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse4))))) (or .cse2 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|)))) is different from false [2024-11-13 13:26:17,995 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse4))))) (or .cse2 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_#t~ret10#1.base|)))) is different from true [2024-11-13 13:26:18,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_52| .cse4))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))))))))) is different from false [2024-11-13 13:26:18,018 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|)))) .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_52| .cse4))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))))))))) is different from true [2024-11-13 13:26:18,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_52| .cse2))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 13:26:18,041 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_52| .cse2))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 13:26:22,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse2)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse3 (select |c_#valid| .cse3))) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_52| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse6 (select |c_#valid| .cse6))) (= .cse6 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse7 (select |c_#valid| .cse7))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |c_#valid| .cse8))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_94| .cse9)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse10 (select |c_#valid| .cse10))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse11 (select |v_old(#valid)_AFTER_CALL_94| .cse11)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_52| .cse12))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse12 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))))))))) is different from false [2024-11-13 13:26:22,063 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse2)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse3) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse3 (select |c_#valid| .cse3))) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_52| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse6 (select |c_#valid| .cse6))) (= .cse6 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse7) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse7 (select |c_#valid| .cse7))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |c_#valid| .cse8))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse9 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse9 (select |v_old(#valid)_AFTER_CALL_94| .cse9)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse10) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse10 (select |c_#valid| .cse10))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse11 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse11 (select |v_old(#valid)_AFTER_CALL_94| .cse11)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_52| .cse12))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse12 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))))))))) is different from true [2024-11-13 13:26:26,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse0 (select |v_old(#valid)_AFTER_CALL_94| .cse0)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_52| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |c_#valid| .cse6))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_52| .cse8))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse8 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) .cse9 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |c_#valid| .cse10))) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |c_#valid| .cse11))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse12 (select |c_#valid| .cse12))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse9 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)))) is different from false [2024-11-13 13:26:26,083 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse0 (select |v_old(#valid)_AFTER_CALL_94| .cse0)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|))))))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |c_#valid| .cse4))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_52| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |c_#valid| .cse6))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_52| .cse8))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse8 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse6)))) .cse9 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |c_#valid| .cse10))) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |c_#valid| .cse11))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse11) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_52| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse12) (= |c_#valid| (store |v_#valid_BEFORE_CALL_52| .cse12 (select |c_#valid| .cse12))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse9 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)))) is different from true [2024-11-13 13:26:30,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse12) (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from false [2024-11-13 13:26:30,104 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse12) (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from true [2024-11-13 13:26:34,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse12) (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from false [2024-11-13 13:26:34,125 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_94| .cse2)) |v_old(#valid)_AFTER_CALL_94|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_52| .cse3))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4))) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse6 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse7)))) (= (store |v_old(#valid)_AFTER_CALL_94| .cse8 (select |v_old(#valid)_AFTER_CALL_95| .cse8)) |v_old(#valid)_AFTER_CALL_95|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse8)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse9)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_52| (Array Int Int))) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= .cse10 |c_ULTIMATE.start_l4_insert_~list#1.base|) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int))) (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse12) (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))) is different from true [2024-11-13 13:26:38,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse0) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_52| .cse4))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= .cse4 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |v_old(#valid)_AFTER_CALL_95| .cse6)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse12) 1) (= .cse13 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse13 (select |v_old(#valid)_AFTER_CALL_94| .cse13)) |v_old(#valid)_AFTER_CALL_94|) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))))) is different from false [2024-11-13 13:26:38,146 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse1 (select |v_old(#valid)_AFTER_CALL_95| .cse1)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_95| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse0) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_52| .cse4))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse5 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= .cse4 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |v_old(#valid)_AFTER_CALL_95| .cse6)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= .cse7 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse10) (= (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse13 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse11 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_52| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse12 (select |v_old(#valid)_AFTER_CALL_95| .cse12)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse12) 1) (= .cse13 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_52| .cse13 (select |v_old(#valid)_AFTER_CALL_94| .cse13)) |v_old(#valid)_AFTER_CALL_94|) (= .cse11 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))))) is different from true [2024-11-13 13:26:42,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse0 .cse3) (and .cse1 .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse4) (= (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |v_old(#valid)_AFTER_CALL_95| .cse6)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse6) 1) (= (select |c_#valid| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse11) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse14 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_52| .cse12))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse14 (select |v_old(#valid)_AFTER_CALL_94| .cse14)) |v_old(#valid)_AFTER_CALL_94|) (= .cse12 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))))) is different from false [2024-11-13 13:26:42,168 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse0 .cse3) (and .cse1 .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse4) (= (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |v_old(#valid)_AFTER_CALL_95| .cse6)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse6) 1) (= (select |c_#valid| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse11) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse14 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_52| .cse12))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse14 (select |v_old(#valid)_AFTER_CALL_94| .cse14)) |v_old(#valid)_AFTER_CALL_94|) (= .cse12 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))))) is different from true [2024-11-13 13:26:46,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse0 .cse3) (and .cse1 .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse4) (= (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |v_old(#valid)_AFTER_CALL_95| .cse6)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse6) 1) (= (select |c_#valid| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse11) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse14 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_52| .cse12))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse14 (select |v_old(#valid)_AFTER_CALL_94| .cse14)) |v_old(#valid)_AFTER_CALL_94|) (= .cse12 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))))) is different from false [2024-11-13 13:26:46,189 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l1_insert_~list#1.base|) (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse0 .cse3) (and .cse1 .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse4) (= (store |v_#valid_BEFORE_CALL_50| .cse4 (select |v_old(#valid)_AFTER_CALL_95| .cse4)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse7 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse6 (select |v_old(#valid)_AFTER_CALL_95| .cse6)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse6) 1) (= (select |c_#valid| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse7 (select |v_old(#valid)_AFTER_CALL_94| .cse7)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse3 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse8 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse8 (select |v_old(#valid)_AFTER_CALL_94| .cse8)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse9 (select |v_old(#valid)_AFTER_CALL_95| .cse9)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse9) 1) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| .cse8) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse10 (select |v_#valid_BEFORE_CALL_52| .cse10))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse11) 1) (= .cse10 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse1) (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse14 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_52| .cse12))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse14 (select |v_old(#valid)_AFTER_CALL_94| .cse14)) |v_old(#valid)_AFTER_CALL_94|) (= .cse12 |c_ULTIMATE.start_l2_insert_~item~2#1.base|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))))))) is different from true [2024-11-13 13:26:50,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse8 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse4 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1))) (.cse7 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse7 .cse0 .cse8) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_52| .cse9))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select |c_#valid| .cse10) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8) (and .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_94| .cse12)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse7 .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_50| .cse14 (select |v_old(#valid)_AFTER_CALL_95| .cse14)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse15 (select |v_old(#valid)_AFTER_CALL_95| .cse15))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))))) is different from false [2024-11-13 13:26:50,227 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l1_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~3#1.base|)) (let ((.cse8 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse4 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1))) (.cse7 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse7 .cse0 .cse8) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_52| .cse9))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select |c_#valid| .cse10) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8) (and .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_94| .cse12)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse7 .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_50| .cse14 (select |v_old(#valid)_AFTER_CALL_95| .cse14)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse15 (select |v_old(#valid)_AFTER_CALL_95| .cse15))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))))) is different from true [2024-11-13 13:26:54,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse8 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse4 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1))) (.cse7 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse7 .cse0 .cse8) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_52| .cse9))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select |c_#valid| .cse10) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8) (and .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_94| .cse12)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse7 .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_50| .cse14 (select |v_old(#valid)_AFTER_CALL_95| .cse14)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse15 (select |v_old(#valid)_AFTER_CALL_95| .cse15))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))))) is different from false [2024-11-13 13:26:54,263 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse8 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1))) (.cse4 (exists ((|ULTIMATE.start_l2_insert_~item~2#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1))) (.cse7 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse2 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_52| .cse1))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse2 (select |v_old(#valid)_AFTER_CALL_95| .cse2)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse3 (select |v_old(#valid)_AFTER_CALL_94| .cse3)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse6 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse5 (select |v_old(#valid)_AFTER_CALL_95| .cse5)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse5) 1) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_52| .cse6 (select |v_old(#valid)_AFTER_CALL_94| .cse6)) |v_old(#valid)_AFTER_CALL_94|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse7 .cse0 .cse8) (and .cse7 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_50| |v_#valid_BEFORE_CALL_52|)) (.cse10 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_#valid_BEFORE_CALL_52| (store |v_#valid_BEFORE_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_52| .cse9))) (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse10 (select |v_old(#valid)_AFTER_CALL_95| .cse10))) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select |c_#valid| .cse10) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 (exists ((|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|))) (and (= (store |v_old(#valid)_AFTER_CALL_94| .cse11 (select |v_old(#valid)_AFTER_CALL_95| .cse11)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_94| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse8) (and .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_94| |v_old(#valid)_AFTER_CALL_95|)) (.cse12 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_94|))) (and (= (store |v_#valid_BEFORE_CALL_50| .cse12 (select |v_old(#valid)_AFTER_CALL_94| .cse12)) |v_old(#valid)_AFTER_CALL_94|) (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_94| .cse13 (select |v_old(#valid)_AFTER_CALL_95| .cse13)) |v_old(#valid)_AFTER_CALL_95|) (= (select |c_#valid| .cse13) 1) (= (select |c_#valid| .cse12) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse7 .cse8 (exists ((|v_#valid_BEFORE_CALL_50| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_50| |v_old(#valid)_AFTER_CALL_95|))) (and (= (select |v_#valid_BEFORE_CALL_50| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse14) 1) (= (store |v_#valid_BEFORE_CALL_50| .cse14 (select |v_old(#valid)_AFTER_CALL_95| .cse14)) |v_old(#valid)_AFTER_CALL_95|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))) (and .cse4 .cse7 (exists ((|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#valid_BEFORE_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse15 (@diff |v_#valid_BEFORE_CALL_52| |v_old(#valid)_AFTER_CALL_95|))) (and (= |v_old(#valid)_AFTER_CALL_95| (store |v_#valid_BEFORE_CALL_52| .cse15 (select |v_old(#valid)_AFTER_CALL_95| .cse15))) (= (select |v_#valid_BEFORE_CALL_52| |c_ULTIMATE.start_l1_insert_~list#1.base|) 1) (= (select |c_#valid| .cse15) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_95| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))))))))) is different from true [2024-11-13 13:26:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:26:56,521 INFO L93 Difference]: Finished difference Result 268 states and 296 transitions. [2024-11-13 13:26:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 13:26:56,521 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 30 states have internal predecessors, (118), 9 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) Word has length 171 [2024-11-13 13:26:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:26:56,523 INFO L225 Difference]: With dead ends: 268 [2024-11-13 13:26:56,523 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 13:26:56,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 201 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 66.5s TimeCoverageRelationStatistics Valid=200, Invalid=1187, Unknown=53, NotChecked=2592, Total=4032 [2024-11-13 13:26:56,524 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 18 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4144 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:26:56,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2155 Invalid, 5830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1649 Invalid, 0 Unknown, 4144 Unchecked, 2.7s Time] [2024-11-13 13:26:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 13:26:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-13 13:26:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 253 states have internal predecessors, (274), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 13:26:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 296 transitions. [2024-11-13 13:26:56,533 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 296 transitions. Word has length 171 [2024-11-13 13:26:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:26:56,533 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 296 transitions. [2024-11-13 13:26:56,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 30 states have internal predecessors, (118), 9 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-13 13:26:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 296 transitions. [2024-11-13 13:26:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:26:56,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:26:56,535 INFO L215 NwaCegarLoop]: trace histogram [71, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:26:56,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-13 13:26:56,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:26:56,737 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:26:56,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:26:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1121160563, now seen corresponding path program 1 times [2024-11-13 13:26:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:26:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974215769] [2024-11-13 13:26:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:26:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:26:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:26:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130705632] [2024-11-13 13:26:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:26:57,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:26:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:26:57,460 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:26:57,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:27:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:02,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-13 13:27:02,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:27:02,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:27:02,074 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 13 treesize of output 9 [2024-11-13 13:27:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 530 proven. 21 refuted. 0 times theorem prover too weak. 2495 trivial. 0 not checked. [2024-11-13 13:27:02,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:27:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2024-11-13 13:27:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974215769] [2024-11-13 13:27:03,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:27:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130705632] [2024-11-13 13:27:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130705632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:27:03,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:27:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-13 13:27:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332465310] [2024-11-13 13:27:03,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:27:03,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:27:03,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:27:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:27:03,789 INFO L87 Difference]: Start difference. First operand 268 states and 296 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 13:27:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:04,825 INFO L93 Difference]: Finished difference Result 278 states and 304 transitions. [2024-11-13 13:27:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:27:04,825 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 171 [2024-11-13 13:27:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:04,827 INFO L225 Difference]: With dead ends: 278 [2024-11-13 13:27:04,827 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 13:27:04,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:27:04,829 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 13 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:04,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1683 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:27:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 13:27:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-13 13:27:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 253 states have internal predecessors, (272), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 13:27:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 294 transitions. [2024-11-13 13:27:04,838 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 294 transitions. Word has length 171 [2024-11-13 13:27:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:04,838 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 294 transitions. [2024-11-13 13:27:04,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 13:27:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 294 transitions. [2024-11-13 13:27:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 13:27:04,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:04,840 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:04,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 13:27:05,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-13 13:27:05,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:27:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1820894259, now seen corresponding path program 2 times [2024-11-13 13:27:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114642730] [2024-11-13 13:27:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:27:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:27:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:27:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:12,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:27:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:27:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:27:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 1665 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2024-11-13 13:27:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114642730] [2024-11-13 13:27:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114642730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:27:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891167499] [2024-11-13 13:27:13,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:27:13,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:27:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:27:13,129 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:27:13,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:27:17,702 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:27:17,702 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:27:17,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 1881 conjuncts, 236 conjuncts are in the unsatisfiable core [2024-11-13 13:27:17,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:27:17,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-13 13:27:25,804 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:27:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:27:25,825 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-13 13:27:26,706 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:27:26,706 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 14 treesize of output 13 [2024-11-13 13:27:26,794 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 13:27:26,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 13:27:28,836 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-11-13 13:27:28,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-11-13 13:27:28,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-13 13:27:30,474 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2024-11-13 13:27:30,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2024-11-13 13:27:30,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-13 13:27:31,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 13:27:35,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:27:35,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-13 13:27:35,080 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-13 13:27:35,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2024-11-13 13:27:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 188 proven. 2717 refuted. 0 times theorem prover too weak. 261 trivial. 35 not checked. [2024-11-13 13:27:36,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:27:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891167499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:27:37,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:27:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 75] total 97 [2024-11-13 13:27:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989897119] [2024-11-13 13:27:37,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:27:37,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2024-11-13 13:27:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2024-11-13 13:27:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=9429, Unknown=1, NotChecked=196, Total=10100 [2024-11-13 13:27:37,962 INFO L87 Difference]: Start difference. First operand 268 states and 294 transitions. Second operand has 98 states, 94 states have (on average 1.9787234042553192) internal successors, (186), 90 states have internal predecessors, (186), 7 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 13:27:42,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:27:55,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:28:04,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:28:08,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:28:12,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:28:16,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:28:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:28:24,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:28:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:31,515 INFO L93 Difference]: Finished difference Result 371 states and 415 transitions. [2024-11-13 13:28:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 13:28:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 94 states have (on average 1.9787234042553192) internal successors, (186), 90 states have internal predecessors, (186), 7 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 173 [2024-11-13 13:28:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:31,517 INFO L225 Difference]: With dead ends: 371 [2024-11-13 13:28:31,517 INFO L226 Difference]: Without dead ends: 371 [2024-11-13 13:28:31,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6001 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=1057, Invalid=17306, Unknown=1, NotChecked=268, Total=18632 [2024-11-13 13:28:31,519 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 297 mSDsluCounter, 3705 mSDsCounter, 0 mSdLazyCounter, 6075 mSolverCounterSat, 32 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 6379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6075 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 45.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:31,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 3864 Invalid, 6379 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 6075 Invalid, 7 Unknown, 265 Unchecked, 45.2s Time] [2024-11-13 13:28:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-13 13:28:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 218. [2024-11-13 13:28:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.353658536585366) internal successors, (222), 208 states have internal predecessors, (222), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:28:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 234 transitions. [2024-11-13 13:28:31,526 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 234 transitions. Word has length 173 [2024-11-13 13:28:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:31,527 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 234 transitions. [2024-11-13 13:28:31,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 94 states have (on average 1.9787234042553192) internal successors, (186), 90 states have internal predecessors, (186), 7 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 13:28:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 234 transitions. [2024-11-13 13:28:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 13:28:31,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:31,529 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:31,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 13:28:31,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 13:28:31,729 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:28:31,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2073577311, now seen corresponding path program 1 times [2024-11-13 13:28:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403913445] [2024-11-13 13:28:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:28:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:28:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:28:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:28:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 753 proven. 140 refuted. 0 times theorem prover too weak. 2308 trivial. 0 not checked. [2024-11-13 13:28:36,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:36,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403913445] [2024-11-13 13:28:36,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403913445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:28:36,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372207201] [2024-11-13 13:28:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:36,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:36,325 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:28:36,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:28:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:37,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 1926 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-13 13:28:37,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:38,144 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 13:28:38,245 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:28:38,245 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 12 treesize of output 14 [2024-11-13 13:28:38,724 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:28:38,724 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 14 treesize of output 13 [2024-11-13 13:28:39,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:28:39,059 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 18 treesize of output 17 [2024-11-13 13:28:39,424 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:28:39,424 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 21 treesize of output 20 [2024-11-13 13:28:39,956 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 13:28:39,956 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 22 treesize of output 28 [2024-11-13 13:28:40,467 INFO L349 Elim1Store]: treesize reduction 40, result has 68.0 percent of original size [2024-11-13 13:28:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 115 [2024-11-13 13:28:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1578 trivial. 1614 not checked. [2024-11-13 13:28:45,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:28:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372207201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:28:45,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:28:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 45 [2024-11-13 13:28:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093681896] [2024-11-13 13:28:45,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:28:45,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-13 13:28:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-13 13:28:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2182, Unknown=1, NotChecked=96, Total=2550 [2024-11-13 13:28:45,881 INFO L87 Difference]: Start difference. First operand 218 states and 234 transitions. Second operand has 47 states, 41 states have (on average 3.048780487804878) internal successors, (125), 35 states have internal predecessors, (125), 10 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-13 13:28:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:49,002 INFO L93 Difference]: Finished difference Result 240 states and 256 transitions. [2024-11-13 13:28:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:28:49,002 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 3.048780487804878) internal successors, (125), 35 states have internal predecessors, (125), 10 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) Word has length 179 [2024-11-13 13:28:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:49,003 INFO L225 Difference]: With dead ends: 240 [2024-11-13 13:28:49,003 INFO L226 Difference]: Without dead ends: 240 [2024-11-13 13:28:49,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=370, Invalid=2825, Unknown=1, NotChecked=110, Total=3306 [2024-11-13 13:28:49,004 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 403 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:49,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2069 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1652 Invalid, 0 Unknown, 190 Unchecked, 2.4s Time] [2024-11-13 13:28:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-13 13:28:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2024-11-13 13:28:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 164 states have (on average 1.3353658536585367) internal successors, (219), 205 states have internal predecessors, (219), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:28:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 231 transitions. [2024-11-13 13:28:49,010 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 231 transitions. Word has length 179 [2024-11-13 13:28:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:49,010 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 231 transitions. [2024-11-13 13:28:49,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 3.048780487804878) internal successors, (125), 35 states have internal predecessors, (125), 10 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-13 13:28:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 231 transitions. [2024-11-13 13:28:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 13:28:49,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:49,012 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:49,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 13:28:49,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:28:49,212 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:28:49,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2073577312, now seen corresponding path program 1 times [2024-11-13 13:28:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864455425] [2024-11-13 13:28:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:28:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:28:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:28:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:28:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 703 proven. 1806 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-11-13 13:28:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864455425] [2024-11-13 13:28:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864455425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:28:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820620831] [2024-11-13 13:28:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:59,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:59,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:59,920 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:28:59,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:29:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:01,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 1926 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-13 13:29:01,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:01,956 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 13:29:02,189 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 13:29:02,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 13:29:02,195 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-13 13:29:02,387 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 13:29:02,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:29:02,620 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-13 13:29:02,661 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:29:02,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:29:02,874 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 13:29:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:29:03,043 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-13 13:29:03,817 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:29:03,818 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 14 treesize of output 13 [2024-11-13 13:29:04,738 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:29:04,738 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 18 treesize of output 17 [2024-11-13 13:29:05,816 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:29:05,816 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 21 treesize of output 20 [2024-11-13 13:29:05,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:29:05,862 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-13 13:29:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:29:06,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:29:06,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2024-11-13 13:29:06,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 13:29:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 419 proven. 250 refuted. 0 times theorem prover too weak. 508 trivial. 2024 not checked. [2024-11-13 13:29:09,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:29:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820620831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:29:11,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:29:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 71 [2024-11-13 13:29:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266128294] [2024-11-13 13:29:11,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:29:11,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-13 13:29:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-13 13:29:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=5314, Unknown=3, NotChecked=450, Total=6162 [2024-11-13 13:29:11,391 INFO L87 Difference]: Start difference. First operand 215 states and 231 transitions. Second operand has 73 states, 68 states have (on average 2.8088235294117645) internal successors, (191), 61 states have internal predecessors, (191), 11 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 13:29:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:19,640 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2024-11-13 13:29:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:29:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 68 states have (on average 2.8088235294117645) internal successors, (191), 61 states have internal predecessors, (191), 11 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Word has length 179 [2024-11-13 13:29:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:19,643 INFO L225 Difference]: With dead ends: 245 [2024-11-13 13:29:19,643 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 13:29:19,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2933 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=906, Invalid=7659, Unknown=3, NotChecked=552, Total=9120 [2024-11-13 13:29:19,647 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 519 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:19,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2972 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2700 Invalid, 0 Unknown, 595 Unchecked, 5.0s Time] [2024-11-13 13:29:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 13:29:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 212. [2024-11-13 13:29:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 164 states have (on average 1.3170731707317074) internal successors, (216), 202 states have internal predecessors, (216), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:29:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2024-11-13 13:29:19,660 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 179 [2024-11-13 13:29:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:19,660 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2024-11-13 13:29:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 68 states have (on average 2.8088235294117645) internal successors, (191), 61 states have internal predecessors, (191), 11 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 13:29:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2024-11-13 13:29:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 13:29:19,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:19,669 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:19,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 13:29:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 13:29:19,871 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:29:19,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1941935088, now seen corresponding path program 1 times [2024-11-13 13:29:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:19,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874897065] [2024-11-13 13:29:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:29:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:20,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:29:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:29:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:29:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2024-11-13 13:29:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874897065] [2024-11-13 13:29:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874897065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:21,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:29:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281003029] [2024-11-13 13:29:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:29:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:29:21,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:29:21,032 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:29:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:22,216 INFO L93 Difference]: Finished difference Result 375 states and 402 transitions. [2024-11-13 13:29:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:29:22,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 187 [2024-11-13 13:29:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:22,218 INFO L225 Difference]: With dead ends: 375 [2024-11-13 13:29:22,218 INFO L226 Difference]: Without dead ends: 375 [2024-11-13 13:29:22,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:29:22,219 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 141 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:22,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 892 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 13:29:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-13 13:29:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 212. [2024-11-13 13:29:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 202 states have internal predecessors, (217), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:29:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 229 transitions. [2024-11-13 13:29:22,226 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 229 transitions. Word has length 187 [2024-11-13 13:29:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:22,227 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 229 transitions. [2024-11-13 13:29:22,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 13:29:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 229 transitions. [2024-11-13 13:29:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 13:29:22,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:22,229 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:22,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 13:29:22,229 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:29:22,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1941935087, now seen corresponding path program 1 times [2024-11-13 13:29:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553580866] [2024-11-13 13:29:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:29:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:29:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:29:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:24,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:29:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2024-11-13 13:29:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553580866] [2024-11-13 13:29:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553580866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:29:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627023648] [2024-11-13 13:29:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:24,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:29:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:29:24,376 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:29:24,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 13:29:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:26,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 1987 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 13:29:26,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:29,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:29:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:29:29,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:29:29,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:29:29,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:29:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-13 13:29:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2024-11-13 13:29:29,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:29:29,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-13 13:29:29,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:29:29,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:29:29,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:29:29,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:29:30,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:29:30,091 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 27 treesize of output 31 [2024-11-13 13:29:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2024-11-13 13:29:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627023648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:29:32,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:29:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44 [2024-11-13 13:29:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609469934] [2024-11-13 13:29:32,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:29:32,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 13:29:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:32,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 13:29:32,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1789, Unknown=0, NotChecked=0, Total=1980 [2024-11-13 13:29:32,083 INFO L87 Difference]: Start difference. First operand 212 states and 229 transitions. Second operand has 45 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-13 13:29:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:35,988 INFO L93 Difference]: Finished difference Result 290 states and 313 transitions. [2024-11-13 13:29:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:29:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 187 [2024-11-13 13:29:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:35,990 INFO L225 Difference]: With dead ends: 290 [2024-11-13 13:29:35,990 INFO L226 Difference]: Without dead ends: 290 [2024-11-13 13:29:35,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=400, Invalid=3632, Unknown=0, NotChecked=0, Total=4032 [2024-11-13 13:29:35,991 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 986 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:35,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 2533 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 13:29:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-13 13:29:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 254. [2024-11-13 13:29:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 207 states have (on average 1.4202898550724639) internal successors, (294), 244 states have internal predecessors, (294), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:29:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 306 transitions. [2024-11-13 13:29:35,998 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 306 transitions. Word has length 187 [2024-11-13 13:29:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:35,998 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 306 transitions. [2024-11-13 13:29:35,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-13 13:29:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 306 transitions. [2024-11-13 13:29:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 13:29:36,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:36,000 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:36,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-13 13:29:36,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 13:29:36,201 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:29:36,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:36,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2111159220, now seen corresponding path program 1 times [2024-11-13 13:29:36,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:36,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457845682] [2024-11-13 13:29:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:29:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:29:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:29:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:29:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2024-11-13 13:29:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457845682] [2024-11-13 13:29:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457845682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:29:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186246440] [2024-11-13 13:29:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:39,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:29:39,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:29:39,007 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:29:39,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 13:29:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:40,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-13 13:29:40,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:43,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:29:43,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 13:29:44,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:29:44,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:29:44,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:29:44,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 13:29:44,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:29:44,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:29:44,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-13 13:29:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2024-11-13 13:29:44,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186246440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:29:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2024-11-13 13:29:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811935994] [2024-11-13 13:29:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:29:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:29:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2024-11-13 13:29:44,435 INFO L87 Difference]: Start difference. First operand 254 states and 306 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 13:29:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:46,464 INFO L93 Difference]: Finished difference Result 308 states and 371 transitions. [2024-11-13 13:29:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:29:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 189 [2024-11-13 13:29:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:46,466 INFO L225 Difference]: With dead ends: 308 [2024-11-13 13:29:46,466 INFO L226 Difference]: Without dead ends: 308 [2024-11-13 13:29:46,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 13:29:46,466 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 218 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:46,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 884 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:29:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-13 13:29:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2024-11-13 13:29:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 208 states have (on average 1.4134615384615385) internal successors, (294), 244 states have internal predecessors, (294), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:29:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 306 transitions. [2024-11-13 13:29:46,475 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 306 transitions. Word has length 189 [2024-11-13 13:29:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 306 transitions. [2024-11-13 13:29:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 13:29:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 306 transitions. [2024-11-13 13:29:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 13:29:46,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:46,477 INFO L215 NwaCegarLoop]: trace histogram [73, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:46,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-13 13:29:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 13:29:46,677 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2024-11-13 13:29:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2111159221, now seen corresponding path program 1 times [2024-11-13 13:29:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883252598] [2024-11-13 13:29:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 13:29:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:29:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:29:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 13:29:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 1310 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-13 13:29:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883252598] [2024-11-13 13:29:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883252598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:29:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515137901] [2024-11-13 13:29:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:51,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:29:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:29:51,377 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:29:51,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c3a8df-f2a3-4821-916a-3b3d0973afa6/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 13:29:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:53,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-13 13:29:53,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:56,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:29:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 13:29:56,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 13:29:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2024-11-13 13:29:56,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:29:56,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:29:56,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:29:56,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-13 13:29:56,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:29:56,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-13 13:29:57,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-13 13:29:57,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-13 13:29:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 124 proven. 769 refuted. 0 times theorem prover too weak. 2308 trivial. 0 not checked. [2024-11-13 13:29:57,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:29:57,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2024-11-13 13:29:57,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 130 [2024-11-13 13:29:57,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2024-11-13 13:29:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2024-11-13 13:31:18,204 INFO L349 Elim1Store]: treesize reduction 11, result has 89.5 percent of original size [2024-11-13 13:31:18,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1065 treesize of output 1122 [2024-11-13 13:31:19,104 INFO L349 Elim1Store]: treesize reduction 11, result has 89.5 percent of original size [2024-11-13 13:31:19,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3084 treesize of output 3009