./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB --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 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:39:30,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:39:30,157 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:39:30,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:39:30,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:39:30,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:39:30,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:39:30,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:39:30,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:39:30,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:39:30,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:39:30,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:39:30,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:39:30,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:39:30,198 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:39:30,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:39:30,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:39:30,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:39:30,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:39:30,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:39:30,199 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:39:30,199 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:39:30,200 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:39:30,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:39:30,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:39:30,200 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:39:30,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:39:30,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:39:30,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:39:30,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:39:30,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:39:30,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:39:30,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:39:30,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:39:30,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:39:30,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:39:30,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:39:30,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:39:30,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:39:30,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:39:30,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:39:30,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:39:30,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:39:30,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:39:30,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:39:30,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:39:30,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:39:30,204 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_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2024-11-28 04:39:30,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:39:30,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:39:30,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:39:30,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:39:30,559 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:39:30,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-28 04:39:34,190 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/data/e0a4257ce/29f2bdc983804e11932ef456ca947e54/FLAG212f46ed4 [2024-11-28 04:39:34,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:39:34,630 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-28 04:39:34,648 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/data/e0a4257ce/29f2bdc983804e11932ef456ca947e54/FLAG212f46ed4 [2024-11-28 04:39:34,677 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/data/e0a4257ce/29f2bdc983804e11932ef456ca947e54 [2024-11-28 04:39:34,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:39:34,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:39:34,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:39:34,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:39:34,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:39:34,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:39:34" (1/1) ... [2024-11-28 04:39:34,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d314c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:34, skipping insertion in model container [2024-11-28 04:39:34,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:39:34" (1/1) ... [2024-11-28 04:39:34,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:39:35,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:39:35,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:39:35,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:39:35,289 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:39:35,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35 WrapperNode [2024-11-28 04:39:35,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:39:35,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:39:35,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:39:35,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:39:35,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,341 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-28 04:39:35,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:39:35,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:39:35,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:39:35,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:39:35,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,387 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-28 04:39:35,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:39:35,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:39:35,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:39:35,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:39:35,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (1/1) ... [2024-11-28 04:39:35,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:39:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:35,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:39:35,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:39:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:39:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:39:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:39:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:39:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:39:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:39:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 04:39:35,502 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:39:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:39:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:39:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:39:35,667 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:39:35,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:39:36,233 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-28 04:39:36,234 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:39:36,253 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:39:36,255 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 04:39:36,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:39:36 BoogieIcfgContainer [2024-11-28 04:39:36,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:39:36,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:39:36,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:39:36,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:39:36,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:39:34" (1/3) ... [2024-11-28 04:39:36,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd83205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:39:36, skipping insertion in model container [2024-11-28 04:39:36,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:39:35" (2/3) ... [2024-11-28 04:39:36,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd83205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:39:36, skipping insertion in model container [2024-11-28 04:39:36,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:39:36" (3/3) ... [2024-11-28 04:39:36,274 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2024-11-28 04:39:36,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:39:36,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_equal.i that has 2 procedures, 134 locations, 1 initial locations, 3 loop locations, and 60 error locations. [2024-11-28 04:39:36,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:39:36,406 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;@102a2fa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:39:36,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-28 04:39:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 129 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:39:36,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:36,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:39:36,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:36,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash 895580210, now seen corresponding path program 1 times [2024-11-28 04:39:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160357811] [2024-11-28 04:39:36,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:36,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-28 04:39:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160357811] [2024-11-28 04:39:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160357811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:39:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051188472] [2024-11-28 04:39:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:36,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:39:36,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:36,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:39:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:39:36,839 INFO L87 Difference]: Start difference. First operand has 134 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 129 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-28 04:39:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:37,078 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-11-28 04:39:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:39:37,083 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-28 04:39:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:37,092 INFO L225 Difference]: With dead ends: 130 [2024-11-28 04:39:37,093 INFO L226 Difference]: Without dead ends: 127 [2024-11-28 04:39:37,096 INFO L434 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-28 04:39:37,102 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:37,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:39:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-28 04:39:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-28 04:39:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 122 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2024-11-28 04:39:37,165 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 6 [2024-11-28 04:39:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2024-11-28 04:39:37,166 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-28 04:39:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2024-11-28 04:39:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:39:37,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:37,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:39:37,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:39:37,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 895580211, now seen corresponding path program 1 times [2024-11-28 04:39:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898709956] [2024-11-28 04:39:37,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:37,332 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-28 04:39:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898709956] [2024-11-28 04:39:37,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898709956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:37,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:37,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:39:37,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259830031] [2024-11-28 04:39:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:37,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:39:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:37,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:39:37,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:39:37,335 INFO L87 Difference]: Start difference. First operand 127 states and 135 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-28 04:39:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:37,474 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-28 04:39:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:39:37,474 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-28 04:39:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:37,476 INFO L225 Difference]: With dead ends: 124 [2024-11-28 04:39:37,476 INFO L226 Difference]: Without dead ends: 124 [2024-11-28 04:39:37,476 INFO L434 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-28 04:39:37,477 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:37,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 205 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:39:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-28 04:39:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-28 04:39:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-28 04:39:37,492 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2024-11-28 04:39:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:37,492 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-28 04:39:37,492 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-28 04:39:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-28 04:39:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 04:39:37,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:37,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:37,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:39:37,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:37,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2012688894, now seen corresponding path program 1 times [2024-11-28 04:39:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084654908] [2024-11-28 04:39:37,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:37,695 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-28 04:39:37,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084654908] [2024-11-28 04:39:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084654908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:37,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:39:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412505385] [2024-11-28 04:39:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:37,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:39:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:37,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:39:37,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:39:37,702 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:37,730 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-28 04:39:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:39:37,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-28 04:39:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:37,736 INFO L225 Difference]: With dead ends: 135 [2024-11-28 04:39:37,736 INFO L226 Difference]: Without dead ends: 135 [2024-11-28 04:39:37,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 04:39:37,737 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 10 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:37,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 255 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:39:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-28 04:39:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-11-28 04:39:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 120 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2024-11-28 04:39:37,761 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 14 [2024-11-28 04:39:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:37,762 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2024-11-28 04:39:37,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2024-11-28 04:39:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 04:39:37,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:37,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:37,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:39:37,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:37,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1408772579, now seen corresponding path program 1 times [2024-11-28 04:39:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:37,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563942084] [2024-11-28 04:39:37,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:39:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563942084] [2024-11-28 04:39:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563942084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:39:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030145826] [2024-11-28 04:39:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:38,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:38,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:38,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:38,072 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:38,415 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-28 04:39:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-28 04:39:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:38,417 INFO L225 Difference]: With dead ends: 124 [2024-11-28 04:39:38,417 INFO L226 Difference]: Without dead ends: 124 [2024-11-28 04:39:38,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:38,418 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 7 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:38,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 378 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:39:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-28 04:39:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-28 04:39:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-28 04:39:38,438 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 24 [2024-11-28 04:39:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-28 04:39:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-28 04:39:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 04:39:38,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:38,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:39:38,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1408772580, now seen corresponding path program 1 times [2024-11-28 04:39:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002343661] [2024-11-28 04:39:38,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002343661] [2024-11-28 04:39:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002343661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:39:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499961489] [2024-11-28 04:39:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:38,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:38,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:38,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:38,892 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:39,207 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2024-11-28 04:39:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:39,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-28 04:39:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:39,209 INFO L225 Difference]: With dead ends: 123 [2024-11-28 04:39:39,209 INFO L226 Difference]: Without dead ends: 123 [2024-11-28 04:39:39,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:39,210 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 6 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:39,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 402 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:39:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-28 04:39:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-28 04:39:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.8656716417910448) internal successors, (125), 118 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2024-11-28 04:39:39,228 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 24 [2024-11-28 04:39:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:39,229 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-11-28 04:39:39,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2024-11-28 04:39:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 04:39:39,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:39,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:39:39,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:39,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 915749892, now seen corresponding path program 1 times [2024-11-28 04:39:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:39,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064762232] [2024-11-28 04:39:39,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:39,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064762232] [2024-11-28 04:39:39,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064762232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:39,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453837075] [2024-11-28 04:39:39,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:39,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:39,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:39,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:39,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:39:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:39,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 04:39:39,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:39,956 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-28 04:39:40,019 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-28 04:39:40,096 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:39:40,097 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-28 04:39:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 04:39:40,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453837075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:39:40,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:39:40,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-28 04:39:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771909135] [2024-11-28 04:39:40,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:40,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:39:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:40,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:39:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-28 04:39:40,471 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:39:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:41,111 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-28 04:39:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:39:41,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-28 04:39:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:41,114 INFO L225 Difference]: With dead ends: 128 [2024-11-28 04:39:41,117 INFO L226 Difference]: Without dead ends: 128 [2024-11-28 04:39:41,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2024-11-28 04:39:41,119 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:41,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 537 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 470 Invalid, 0 Unknown, 132 Unchecked, 0.6s Time] [2024-11-28 04:39:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-28 04:39:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-28 04:39:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:39:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-28 04:39:41,129 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 26 [2024-11-28 04:39:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:41,129 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-28 04:39:41,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:39:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-28 04:39:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 04:39:41,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:41,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:41,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:41,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:41,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash 915749893, now seen corresponding path program 1 times [2024-11-28 04:39:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259764941] [2024-11-28 04:39:41,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259764941] [2024-11-28 04:39:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259764941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364380370] [2024-11-28 04:39:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:42,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:42,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:42,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:39:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:42,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 04:39:42,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:42,308 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-28 04:39:42,313 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-28 04:39:42,581 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 04:39:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:42,672 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-28 04:39:42,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:39:42,688 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-28 04:39:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 04:39:42,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364380370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:42,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:39:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-28 04:39:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34095965] [2024-11-28 04:39:42,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:39:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:42,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:39:42,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-28 04:39:42,988 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:39:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:43,918 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-11-28 04:39:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:39:43,918 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-28 04:39:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:43,920 INFO L225 Difference]: With dead ends: 128 [2024-11-28 04:39:43,920 INFO L226 Difference]: Without dead ends: 128 [2024-11-28 04:39:43,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:39:43,921 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:43,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 659 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 740 Invalid, 0 Unknown, 131 Unchecked, 0.8s Time] [2024-11-28 04:39:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-28 04:39:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-28 04:39:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:39:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2024-11-28 04:39:43,929 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 26 [2024-11-28 04:39:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2024-11-28 04:39:43,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:39:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2024-11-28 04:39:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 04:39:43,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:43,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:43,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:44,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 04:39:44,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -432495303, now seen corresponding path program 1 times [2024-11-28 04:39:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979262588] [2024-11-28 04:39:44,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979262588] [2024-11-28 04:39:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979262588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456110319] [2024-11-28 04:39:44,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:44,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:44,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:39:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:44,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 04:39:44,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:44,464 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-28 04:39:44,568 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-28 04:39:44,605 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:39:44,605 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-28 04:39:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-28 04:39:44,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456110319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:39:44,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:39:44,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2024-11-28 04:39:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833163712] [2024-11-28 04:39:44,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:44,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:39:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:44,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:39:44,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2024-11-28 04:39:44,900 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:39:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:45,408 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2024-11-28 04:39:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:39:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-28 04:39:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:45,412 INFO L225 Difference]: With dead ends: 127 [2024-11-28 04:39:45,412 INFO L226 Difference]: Without dead ends: 127 [2024-11-28 04:39:45,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-28 04:39:45,414 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:45,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 862 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2024-11-28 04:39:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-28 04:39:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-28 04:39:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 121 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:39:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-28 04:39:45,430 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 28 [2024-11-28 04:39:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:45,430 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-28 04:39:45,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:39:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-28 04:39:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:39:45,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:45,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:45,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:39:45,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:45,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -527234097, now seen corresponding path program 1 times [2024-11-28 04:39:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:45,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439412719] [2024-11-28 04:39:45,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:45,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:45,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439412719] [2024-11-28 04:39:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439412719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:45,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80293377] [2024-11-28 04:39:45,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:45,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:45,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:45,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:39:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:46,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 04:39:46,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:46,180 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-28 04:39:46,189 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-28 04:39:46,408 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 04:39:46,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:46,479 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-28 04:39:46,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:39:46,490 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-28 04:39:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 04:39:46,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80293377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:46,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:39:46,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-28 04:39:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274284043] [2024-11-28 04:39:46,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:46,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:39:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:46,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:39:46,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-28 04:39:46,744 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:39:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:47,326 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-28 04:39:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:39:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-28 04:39:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:47,328 INFO L225 Difference]: With dead ends: 144 [2024-11-28 04:39:47,328 INFO L226 Difference]: Without dead ends: 144 [2024-11-28 04:39:47,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2024-11-28 04:39:47,329 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 16 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:47,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 804 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 353 Invalid, 0 Unknown, 151 Unchecked, 0.4s Time] [2024-11-28 04:39:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-28 04:39:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2024-11-28 04:39:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.775) internal successors, (142), 130 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:39:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-28 04:39:47,345 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 29 [2024-11-28 04:39:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:47,345 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-28 04:39:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 04:39:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-28 04:39:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 04:39:47,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:47,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:47,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:39:47,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 04:39:47,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:47,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash 835612151, now seen corresponding path program 1 times [2024-11-28 04:39:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755452543] [2024-11-28 04:39:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:39:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755452543] [2024-11-28 04:39:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755452543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:39:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370049783] [2024-11-28 04:39:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:47,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:39:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:47,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:39:47,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:47,736 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:48,063 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-28 04:39:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:39:48,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-28 04:39:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:48,065 INFO L225 Difference]: With dead ends: 136 [2024-11-28 04:39:48,065 INFO L226 Difference]: Without dead ends: 136 [2024-11-28 04:39:48,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:48,066 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:48,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 428 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:39:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-28 04:39:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-28 04:39:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.7625) internal successors, (141), 129 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:39:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-28 04:39:48,071 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 30 [2024-11-28 04:39:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:48,072 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-28 04:39:48,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-28 04:39:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 04:39:48,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:48,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:48,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:39:48,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 835612152, now seen corresponding path program 1 times [2024-11-28 04:39:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888708063] [2024-11-28 04:39:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888708063] [2024-11-28 04:39:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888708063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:39:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077309948] [2024-11-28 04:39:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:48,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:39:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:48,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:39:48,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:48,321 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:48,627 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-28 04:39:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:39:48,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-28 04:39:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:48,628 INFO L225 Difference]: With dead ends: 135 [2024-11-28 04:39:48,629 INFO L226 Difference]: Without dead ends: 135 [2024-11-28 04:39:48,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:48,629 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:48,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 453 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:39:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-28 04:39:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-28 04:39:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.75) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:39:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2024-11-28 04:39:48,639 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 30 [2024-11-28 04:39:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2024-11-28 04:39:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:39:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2024-11-28 04:39:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 04:39:48,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:48,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:48,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:39:48,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:48,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1494558672, now seen corresponding path program 1 times [2024-11-28 04:39:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:48,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711825806] [2024-11-28 04:39:48,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 04:39:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711825806] [2024-11-28 04:39:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711825806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716450932] [2024-11-28 04:39:48,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:48,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:48,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:48,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:48,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:39:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:48,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:39:48,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:39:49,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:39:49,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716450932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:49,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:39:49,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-28 04:39:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967478406] [2024-11-28 04:39:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:49,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:39:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:49,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:39:49,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:39:49,038 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:39:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:49,059 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-28 04:39:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:39:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-28 04:39:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:49,060 INFO L225 Difference]: With dead ends: 117 [2024-11-28 04:39:49,061 INFO L226 Difference]: Without dead ends: 117 [2024-11-28 04:39:49,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-28 04:39:49,062 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:49,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:39:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-28 04:39:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-28 04:39:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 112 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2024-11-28 04:39:49,068 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 41 [2024-11-28 04:39:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:49,068 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2024-11-28 04:39:49,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:39:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2024-11-28 04:39:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 04:39:49,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:49,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:49,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:39:49,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:39:49,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 823557164, now seen corresponding path program 1 times [2024-11-28 04:39:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652221893] [2024-11-28 04:39:49,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:39:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652221893] [2024-11-28 04:39:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652221893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698763607] [2024-11-28 04:39:49,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:49,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:49,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:39:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:50,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 04:39:50,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:50,190 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-28 04:39:50,249 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:39:50,250 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-28 04:39:50,358 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:39:50,358 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-28 04:39:50,579 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-28 04:39:50,610 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:39:50,610 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-28 04:39:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2024-11-28 04:39:50,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:39:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698763607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:39:51,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:39:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 28 [2024-11-28 04:39:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138073925] [2024-11-28 04:39:51,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 04:39:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:51,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 04:39:51,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=617, Unknown=1, NotChecked=52, Total=812 [2024-11-28 04:39:51,739 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-28 04:39:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:52,550 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2024-11-28 04:39:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:39:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 43 [2024-11-28 04:39:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:52,552 INFO L225 Difference]: With dead ends: 127 [2024-11-28 04:39:52,552 INFO L226 Difference]: Without dead ends: 127 [2024-11-28 04:39:52,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=802, Unknown=1, NotChecked=60, Total=1056 [2024-11-28 04:39:52,553 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 199 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:52,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 384 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 540 Invalid, 0 Unknown, 127 Unchecked, 0.6s Time] [2024-11-28 04:39:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-28 04:39:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2024-11-28 04:39:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.626865671641791) internal successors, (109), 104 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2024-11-28 04:39:52,559 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 43 [2024-11-28 04:39:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:52,559 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2024-11-28 04:39:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-28 04:39:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2024-11-28 04:39:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 04:39:52,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:52,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:52,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:39:52,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 04:39:52,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 823557165, now seen corresponding path program 1 times [2024-11-28 04:39:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59263337] [2024-11-28 04:39:52,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 04:39:53,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59263337] [2024-11-28 04:39:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59263337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732548001] [2024-11-28 04:39:53,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:53,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:53,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:53,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:53,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:39:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:53,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 04:39:53,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:53,875 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-28 04:39:53,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:39:53,902 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-28 04:39:53,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:53,963 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-28 04:39:54,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:39:54,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:54,087 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-28 04:39:54,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:39:54,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:54,261 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-28 04:39:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:39:54,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:39:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732548001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:39:54,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2024-11-28 04:39:54,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706948094] [2024-11-28 04:39:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:39:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:54,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:39:54,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-28 04:39:54,274 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:39:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:54,541 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-28 04:39:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:39:54,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-28 04:39:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:54,542 INFO L225 Difference]: With dead ends: 104 [2024-11-28 04:39:54,542 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 04:39:54,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-28 04:39:54,543 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 26 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:54,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 280 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2024-11-28 04:39:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 04:39:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-28 04:39:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2024-11-28 04:39:54,552 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 43 [2024-11-28 04:39:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2024-11-28 04:39:54,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:39:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2024-11-28 04:39:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 04:39:54,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:54,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:54,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 04:39:54,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:54,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1164452717, now seen corresponding path program 1 times [2024-11-28 04:39:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502027334] [2024-11-28 04:39:54,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 04:39:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502027334] [2024-11-28 04:39:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502027334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:54,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:54,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:39:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861653437] [2024-11-28 04:39:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:54,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:54,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:54,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:54,924 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:39:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:55,157 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-28 04:39:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-28 04:39:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:55,158 INFO L225 Difference]: With dead ends: 100 [2024-11-28 04:39:55,159 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 04:39:55,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:55,160 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 19 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:55,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 285 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:39:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 04:39:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 04:39:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.492537313432836) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-28 04:39:55,167 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 45 [2024-11-28 04:39:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:55,167 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-28 04:39:55,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:39:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-28 04:39:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 04:39:55,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:55,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:55,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:39:55,170 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:55,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1164452718, now seen corresponding path program 1 times [2024-11-28 04:39:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087059230] [2024-11-28 04:39:55,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:39:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:55,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087059230] [2024-11-28 04:39:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087059230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064640364] [2024-11-28 04:39:55,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:55,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:55,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:55,550 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:55,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:39:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:55,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 04:39:55,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:55,817 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-28 04:39:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:39:55,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:39:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064640364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:55,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:39:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-28 04:39:55,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247343254] [2024-11-28 04:39:55,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:55,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:55,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:55,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:39:55,951 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:39:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:56,189 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-28 04:39:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-28 04:39:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:56,191 INFO L225 Difference]: With dead ends: 96 [2024-11-28 04:39:56,191 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 04:39:56,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:39:56,192 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 18 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:56,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 297 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:39:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 04:39:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-28 04:39:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-28 04:39:56,197 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 45 [2024-11-28 04:39:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:56,198 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-28 04:39:56,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:39:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-28 04:39:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 04:39:56,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:56,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:56,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:56,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 04:39:56,409 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:56,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1738306804, now seen corresponding path program 1 times [2024-11-28 04:39:56,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:56,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58237862] [2024-11-28 04:39:56,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58237862] [2024-11-28 04:39:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58237862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47791869] [2024-11-28 04:39:56,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:56,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:56,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:56,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:56,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:39:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:57,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 04:39:57,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:57,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:39:57,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-28 04:39:57,493 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 04:39:57,493 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 16 treesize of output 18 [2024-11-28 04:39:57,551 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 17 treesize of output 9 [2024-11-28 04:39:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:39:57,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:39:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47791869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:57,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:39:57,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2024-11-28 04:39:57,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995751474] [2024-11-28 04:39:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:57,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:39:57,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:57,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:39:57,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2024-11-28 04:39:57,557 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:39:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:57,836 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-11-28 04:39:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:39:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-28 04:39:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:57,837 INFO L225 Difference]: With dead ends: 95 [2024-11-28 04:39:57,838 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 04:39:57,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=364, Unknown=1, NotChecked=38, Total=462 [2024-11-28 04:39:57,839 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 15 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:57,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 158 Unchecked, 0.2s Time] [2024-11-28 04:39:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 04:39:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-28 04:39:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:39:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-28 04:39:57,844 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 46 [2024-11-28 04:39:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:57,844 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-28 04:39:57,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:39:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-28 04:39:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 04:39:57,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:57,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:57,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:58,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:58,046 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:39:58,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1738306805, now seen corresponding path program 1 times [2024-11-28 04:39:58,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:58,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508168827] [2024-11-28 04:39:58,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:39:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:58,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508168827] [2024-11-28 04:39:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508168827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302586168] [2024-11-28 04:39:58,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:58,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:58,786 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:58,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:39:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:59,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 04:39:59,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:59,477 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 15 treesize of output 9 [2024-11-28 04:39:59,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:39:59,565 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (<= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0)))) is different from true [2024-11-28 04:39:59,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:59,649 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 24 treesize of output 19 [2024-11-28 04:39:59,666 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:39:59,667 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 15 treesize of output 15 [2024-11-28 04:39:59,784 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 23 treesize of output 15 [2024-11-28 04:39:59,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:39:59,796 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-28 04:39:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-28 04:39:59,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302586168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:00,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-11-28 04:40:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698251034] [2024-11-28 04:40:00,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:00,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:40:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:00,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:40:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=684, Unknown=1, NotChecked=52, Total=812 [2024-11-28 04:40:00,112 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 26 states, 24 states have (on average 3.0) internal successors, (72), 22 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:40:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:01,507 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-28 04:40:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:40:01,508 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0) internal successors, (72), 22 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2024-11-28 04:40:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:01,509 INFO L225 Difference]: With dead ends: 102 [2024-11-28 04:40:01,509 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 04:40:01,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=151, Invalid=1412, Unknown=1, NotChecked=76, Total=1640 [2024-11-28 04:40:01,510 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 69 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:01,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1025 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 907 Invalid, 0 Unknown, 100 Unchecked, 0.9s Time] [2024-11-28 04:40:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 04:40:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 04:40:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.364864864864865) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-28 04:40:01,522 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 46 [2024-11-28 04:40:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:01,522 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-28 04:40:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0) internal successors, (72), 22 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 04:40:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-28 04:40:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:40:01,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:01,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:01,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:40:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:40:01,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -229438347, now seen corresponding path program 1 times [2024-11-28 04:40:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38421746] [2024-11-28 04:40:01,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:40:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:03,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38421746] [2024-11-28 04:40:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38421746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:03,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801818547] [2024-11-28 04:40:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:03,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:03,533 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:03,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:40:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:03,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-28 04:40:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:04,215 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-28 04:40:04,376 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 13 treesize of output 5 [2024-11-28 04:40:04,382 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 04:40:04,383 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 15 treesize of output 7 [2024-11-28 04:40:04,630 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2024-11-28 04:40:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:40:04,670 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 22 treesize of output 17 [2024-11-28 04:40:04,713 INFO L349 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2024-11-28 04:40:04,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2024-11-28 04:40:04,848 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 30 treesize of output 18 [2024-11-28 04:40:04,913 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 17 treesize of output 9 [2024-11-28 04:40:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-28 04:40:04,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801818547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:05,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 34 [2024-11-28 04:40:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783514923] [2024-11-28 04:40:05,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 04:40:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:05,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:40:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1231, Unknown=1, NotChecked=70, Total=1406 [2024-11-28 04:40:05,170 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 35 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 31 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:40:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:07,274 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-28 04:40:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:40:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 31 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2024-11-28 04:40:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:07,275 INFO L225 Difference]: With dead ends: 101 [2024-11-28 04:40:07,275 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 04:40:07,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=223, Invalid=2536, Unknown=1, NotChecked=102, Total=2862 [2024-11-28 04:40:07,277 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 52 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:07,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1165 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1282 Invalid, 0 Unknown, 103 Unchecked, 1.3s Time] [2024-11-28 04:40:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 04:40:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-28 04:40:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-28 04:40:07,282 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 48 [2024-11-28 04:40:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:07,283 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-28 04:40:07,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 31 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:40:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-28 04:40:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:40:07,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:07,284 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:07,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:40:07,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:07,485 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:07,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash -229438346, now seen corresponding path program 1 times [2024-11-28 04:40:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771469045] [2024-11-28 04:40:07,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:40:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771469045] [2024-11-28 04:40:09,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771469045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933893721] [2024-11-28 04:40:09,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:09,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:09,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:09,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:09,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:40:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:10,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-28 04:40:10,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:10,246 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-28 04:40:10,251 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-28 04:40:10,637 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 11 treesize of output 7 [2024-11-28 04:40:10,704 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 23 treesize of output 11 [2024-11-28 04:40:10,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:40:10,816 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-28 04:40:10,826 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-28 04:40:11,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:40:11,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:40:11,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:40:11,457 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 11 treesize of output 7 [2024-11-28 04:40:11,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-28 04:40:11,847 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 55 treesize of output 23 [2024-11-28 04:40:11,856 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 11 treesize of output 3 [2024-11-28 04:40:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:40:11,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-28 04:40:12,316 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2024-11-28 04:40:12,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:40:12,400 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 63 treesize of output 40 [2024-11-28 04:40:12,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:40:12,417 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 22 treesize of output 17 [2024-11-28 04:40:12,450 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 04:40:12,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 04:40:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 04:40:12,658 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 60 treesize of output 36 [2024-11-28 04:40:12,758 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 33 treesize of output 17 [2024-11-28 04:40:12,770 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 7 treesize of output 3 [2024-11-28 04:40:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 04:40:12,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933893721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:13,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 49 [2024-11-28 04:40:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356593446] [2024-11-28 04:40:13,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:13,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 04:40:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:13,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 04:40:13,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2691, Unknown=1, NotChecked=104, Total=2970 [2024-11-28 04:40:13,468 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 43 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:40:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:16,461 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-28 04:40:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 04:40:16,462 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 43 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2024-11-28 04:40:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:16,463 INFO L225 Difference]: With dead ends: 100 [2024-11-28 04:40:16,463 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 04:40:16,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=352, Invalid=5053, Unknown=1, NotChecked=144, Total=5550 [2024-11-28 04:40:16,464 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:16,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1210 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1498 Invalid, 0 Unknown, 102 Unchecked, 1.4s Time] [2024-11-28 04:40:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 04:40:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 04:40:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.337837837837838) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-28 04:40:16,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 48 [2024-11-28 04:40:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-28 04:40:16,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 43 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:40:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-28 04:40:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 04:40:16,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:16,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:16,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:40:16,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-28 04:40:16,671 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:16,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1151928882, now seen corresponding path program 1 times [2024-11-28 04:40:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44685834] [2024-11-28 04:40:16,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:40:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44685834] [2024-11-28 04:40:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44685834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133252926] [2024-11-28 04:40:17,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:17,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:17,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:17,100 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:17,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:40:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:17,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 04:40:17,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:17,421 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-28 04:40:17,436 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-28 04:40:17,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:40:17,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:40:17,640 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:40:17,641 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-28 04:40:17,659 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-28 04:40:17,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-28 04:40:17,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:40:17,825 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 04:40:17,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:40:17,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:40:17,898 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 04:40:17,898 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-28 04:40:18,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:40:18,067 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-28 04:40:18,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:40:18,125 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-28 04:40:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 21 not checked. [2024-11-28 04:40:18,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133252926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:18,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-28 04:40:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244728980] [2024-11-28 04:40:18,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:18,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:40:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:18,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:40:18,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=362, Unknown=2, NotChecked=78, Total=506 [2024-11-28 04:40:18,396 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:40:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:19,333 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-28 04:40:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:40:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-11-28 04:40:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:19,335 INFO L225 Difference]: With dead ends: 94 [2024-11-28 04:40:19,335 INFO L226 Difference]: Without dead ends: 94 [2024-11-28 04:40:19,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-11-28 04:40:19,336 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 125 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:19,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 604 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 538 Invalid, 0 Unknown, 168 Unchecked, 0.6s Time] [2024-11-28 04:40:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-28 04:40:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-28 04:40:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.295774647887324) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-28 04:40:19,342 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 49 [2024-11-28 04:40:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:19,344 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-28 04:40:19,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:40:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-28 04:40:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:40:19,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:19,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:19,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:40:19,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:19,549 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:19,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash -423062658, now seen corresponding path program 1 times [2024-11-28 04:40:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169892422] [2024-11-28 04:40:19,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:40:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169892422] [2024-11-28 04:40:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169892422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:40:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:40:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:40:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514497874] [2024-11-28 04:40:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:40:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:40:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:19,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:40:19,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:40:19,725 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:40:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:19,831 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-28 04:40:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:40:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-28 04:40:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:19,834 INFO L225 Difference]: With dead ends: 93 [2024-11-28 04:40:19,834 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 04:40:19,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:40:19,836 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:19,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:40:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 04:40:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 04:40:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 87 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-28 04:40:19,846 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 54 [2024-11-28 04:40:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:19,847 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-28 04:40:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:40:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-28 04:40:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:40:19,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:19,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:19,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 04:40:19,850 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:19,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash -423062657, now seen corresponding path program 1 times [2024-11-28 04:40:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:19,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346064348] [2024-11-28 04:40:19,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 04:40:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346064348] [2024-11-28 04:40:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346064348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210714891] [2024-11-28 04:40:20,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:20,375 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:20,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:40:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:20,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 04:40:20,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:20,855 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 23 treesize of output 15 [2024-11-28 04:40:20,860 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 28 treesize of output 16 [2024-11-28 04:40:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:40:20,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:40:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210714891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:40:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:40:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-11-28 04:40:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268464537] [2024-11-28 04:40:20,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:40:20,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:40:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:20,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:40:20,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:40:20,891 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:40:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:21,016 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-28 04:40:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:40:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-28 04:40:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:21,018 INFO L225 Difference]: With dead ends: 92 [2024-11-28 04:40:21,018 INFO L226 Difference]: Without dead ends: 92 [2024-11-28 04:40:21,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:40:21,019 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:21,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:40:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-28 04:40:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-28 04:40:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.267605633802817) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-28 04:40:21,031 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 54 [2024-11-28 04:40:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:21,031 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-28 04:40:21,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 04:40:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-28 04:40:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:40:21,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:21,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:21,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:40:21,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:21,233 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:21,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash -926002625, now seen corresponding path program 1 times [2024-11-28 04:40:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:21,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063920926] [2024-11-28 04:40:21,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 04:40:21,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:21,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063920926] [2024-11-28 04:40:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063920926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:40:21,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:40:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:40:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265959279] [2024-11-28 04:40:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:40:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:40:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:21,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:40:21,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:40:21,543 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:40:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:21,696 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-28 04:40:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:40:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-28 04:40:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:21,698 INFO L225 Difference]: With dead ends: 96 [2024-11-28 04:40:21,698 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 04:40:21,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:40:21,699 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:21,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 265 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:40:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 04:40:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-28 04:40:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-28 04:40:21,704 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 59 [2024-11-28 04:40:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:21,704 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-28 04:40:21,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:40:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-28 04:40:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:40:21,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:21,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:21,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 04:40:21,706 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:21,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash -926002624, now seen corresponding path program 1 times [2024-11-28 04:40:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:21,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650542934] [2024-11-28 04:40:21,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:21,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:40:22,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650542934] [2024-11-28 04:40:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650542934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891618593] [2024-11-28 04:40:22,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:22,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:22,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:22,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:22,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:40:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:23,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 04:40:23,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:23,298 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-28 04:40:23,306 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-28 04:40:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:23,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:24,107 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:40:24,108 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 15 treesize of output 15 [2024-11-28 04:40:24,128 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 18 treesize of output 13 [2024-11-28 04:40:24,530 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 17 treesize of output 9 [2024-11-28 04:40:24,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:24,542 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-11-28 04:40:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:40:24,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:25,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891618593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:25,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:25,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2024-11-28 04:40:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423987608] [2024-11-28 04:40:25,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:25,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 04:40:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:25,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 04:40:25,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1287, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 04:40:25,104 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 34 states, 31 states have (on average 3.064516129032258) internal successors, (95), 29 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:40:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:26,363 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2024-11-28 04:40:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:40:26,364 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 3.064516129032258) internal successors, (95), 29 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2024-11-28 04:40:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:26,365 INFO L225 Difference]: With dead ends: 98 [2024-11-28 04:40:26,365 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 04:40:26,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=1969, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 04:40:26,366 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:26,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 721 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:40:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 04:40:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-28 04:40:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-28 04:40:26,371 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 59 [2024-11-28 04:40:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:26,371 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-28 04:40:26,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 3.064516129032258) internal successors, (95), 29 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 04:40:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-28 04:40:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-28 04:40:26,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:26,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:26,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:40:26,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 04:40:26,573 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:26,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 955219171, now seen corresponding path program 1 times [2024-11-28 04:40:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778333261] [2024-11-28 04:40:26,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:40:30,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:30,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778333261] [2024-11-28 04:40:30,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778333261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:30,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365152800] [2024-11-28 04:40:30,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:30,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:30,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:30,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:30,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:40:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:31,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-28 04:40:31,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:32,006 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-28 04:40:32,315 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 11 treesize of output 7 [2024-11-28 04:40:32,472 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:40:32,472 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-28 04:40:32,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:40:32,779 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 16 treesize of output 11 [2024-11-28 04:40:32,979 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 16 treesize of output 11 [2024-11-28 04:40:33,007 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 23 treesize of output 11 [2024-11-28 04:40:33,019 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 15 treesize of output 1 [2024-11-28 04:40:33,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:33,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 04:40:33,350 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 11 treesize of output 3 [2024-11-28 04:40:33,911 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:40:33,911 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 04:40:33,943 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:40:33,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 1 case distinctions, treesize of input 25 treesize of output 28 [2024-11-28 04:40:33,954 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 10 treesize of output 8 [2024-11-28 04:40:33,978 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:40:33,978 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 15 treesize of output 15 [2024-11-28 04:40:34,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:34,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:34,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2024-11-28 04:40:34,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 04:40:35,046 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 20 treesize of output 15 [2024-11-28 04:40:35,242 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 20 treesize of output 15 [2024-11-28 04:40:35,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:40:35,535 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 43 treesize of output 15 [2024-11-28 04:40:35,691 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 19 treesize of output 11 [2024-11-28 04:40:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:40:35,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:36,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (v_ArrVal_3281 Int) (v_ArrVal_3278 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3278)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3281))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2024-11-28 04:40:36,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (v_ArrVal_3281 Int) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3278 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3276) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3278)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3281))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2024-11-28 04:40:36,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (v_ArrVal_3281 Int) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3278 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_3276) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3278)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3281))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2024-11-28 04:40:37,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (v_ArrVal_3281 Int) (v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3278 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ .cse2 4)) v_ArrVal_3276) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3278))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3281)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< .cse2 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|)))) is different from false [2024-11-28 04:40:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365152800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:37,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 68 [2024-11-28 04:40:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331120352] [2024-11-28 04:40:37,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-28 04:40:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:37,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-28 04:40:37,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=5308, Unknown=78, NotChecked=604, Total=6320 [2024-11-28 04:40:37,848 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 68 states, 64 states have (on average 1.6875) internal successors, (108), 59 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:40:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:41,865 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2024-11-28 04:40:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 04:40:41,866 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.6875) internal successors, (108), 59 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2024-11-28 04:40:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:41,867 INFO L225 Difference]: With dead ends: 98 [2024-11-28 04:40:41,867 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 04:40:41,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=553, Invalid=9085, Unknown=80, NotChecked=788, Total=10506 [2024-11-28 04:40:41,870 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 71 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:41,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1698 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 04:40:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 04:40:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-28 04:40:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:40:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-28 04:40:41,874 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 63 [2024-11-28 04:40:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:41,874 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-28 04:40:41,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.6875) internal successors, (108), 59 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 04:40:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-28 04:40:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:40:41,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:41,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:40:41,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 04:40:42,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 04:40:42,076 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:40:42,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:42,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1162205360, now seen corresponding path program 1 times [2024-11-28 04:40:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:42,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834229698] [2024-11-28 04:40:42,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:40:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834229698] [2024-11-28 04:40:45,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834229698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342328498] [2024-11-28 04:40:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:45,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:45,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:45,698 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:45,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:40:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:46,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-28 04:40:46,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:46,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 6 treesize of output 5 [2024-11-28 04:40:46,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:40:46,268 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-28 04:40:46,362 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 11 treesize of output 7 [2024-11-28 04:40:46,433 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 16 treesize of output 11 [2024-11-28 04:40:46,549 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 16 treesize of output 11 [2024-11-28 04:40:46,619 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 35 treesize of output 26 [2024-11-28 04:40:46,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:46,848 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 17 [2024-11-28 04:40:46,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:40:47,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (not (= .cse0 .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (= .cse0 (select .cse3 (+ .cse4 4))))))) is different from false [2024-11-28 04:40:47,070 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (not (= .cse0 .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (= .cse0 (select .cse3 (+ .cse4 4))))))) is different from true [2024-11-28 04:40:47,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= .cse0 (select .cse3 (+ .cse4 4))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-28 04:40:47,104 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= .cse0 (select .cse3 (+ .cse4 4))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-28 04:40:47,304 INFO L349 Elim1Store]: treesize reduction 68, result has 49.6 percent of original size [2024-11-28 04:40:47,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 90 [2024-11-28 04:40:47,449 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= .cse0 .cse3)))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3)))))))) is different from false [2024-11-28 04:40:47,453 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= .cse0 .cse3)))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3)))))))) is different from true [2024-11-28 04:40:47,528 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-28 04:40:47,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 172 [2024-11-28 04:40:47,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:40:47,660 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-11-28 04:40:47,665 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-11-28 04:40:47,790 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-28 04:40:47,791 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 1 case distinctions, treesize of input 204 treesize of output 157 [2024-11-28 04:40:47,977 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|) |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-11-28 04:40:47,980 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|) |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-11-28 04:40:48,096 INFO L349 Elim1Store]: treesize reduction 96, result has 43.9 percent of original size [2024-11-28 04:40:48,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 206 [2024-11-28 04:40:49,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse15 (+ .cse5 4))) (let ((.cse3 (select .cse27 .cse15))) (let ((.cse6 (not (= .cse1 .cse3))) (.cse8 (select .cse27 .cse5))) (or (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5))) (and (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= .cse2 .cse3) (exists ((v_arrayElimCell_120 Int) (v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_120) 1) (= 0 (select v_prenex_7 .cse2)) (not (= v_arrayElimCell_120 .cse1)) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))))))) (and .cse6 (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse7) 1) (= .cse8 .cse7) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int) (v_prenex_7 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) .cse5))) (and (= .cse10 .cse1) (= (select |c_#valid| .cse11) 1) (= 0 (select v_prenex_7 .cse11)) (= (select v_prenex_7 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_7 .cse1) 1))))) .cse6) (and (not (= .cse8 .cse1)) (or (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| .cse13) .cse15))) (and (= .cse13 .cse1) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_7 .cse14) 0))))) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= (select v_prenex_7 .cse1) 1))) (and (= .cse8 .cse3) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_prenex_7 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse17) 1) (= (select v_prenex_7 .cse8) 1) (= |c_#valid| (let ((.cse18 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse18 (select |c_#valid| .cse18)))) (= (select v_prenex_7 .cse17) 0) (= (select v_prenex_7 .cse1) 1))))) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse19) 1) (= .cse19 .cse3) (= (select v_prenex_7 .cse19) 0)))) (= |c_#valid| (let ((.cse20 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse20 (select |c_#valid| .cse20)))) (= (select v_prenex_7 .cse1) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse21) .cse5))) (and (= .cse21 .cse1) (= (select |c_#valid| .cse22) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse22) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse23 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse23 (select |c_#valid| .cse23)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_arrayElimCell_119 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| .cse24) .cse15))) (and (= .cse24 .cse1) (= .cse25 .cse8) (= (select |v_old(#valid)_AFTER_CALL_47| .cse25) 0) (= (select |c_#valid| .cse25) 1) (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_119) 1) (not (= v_arrayElimCell_119 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse26 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse26 (select |c_#valid| .cse26))))))))))))) is different from false [2024-11-28 04:40:49,102 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse15 (+ .cse5 4))) (let ((.cse3 (select .cse27 .cse15))) (let ((.cse6 (not (= .cse1 .cse3))) (.cse8 (select .cse27 .cse5))) (or (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5))) (and (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= .cse2 .cse3) (exists ((v_arrayElimCell_120 Int) (v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_120) 1) (= 0 (select v_prenex_7 .cse2)) (not (= v_arrayElimCell_120 .cse1)) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))))))) (and .cse6 (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse7) 1) (= .cse8 .cse7) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int) (v_prenex_7 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) .cse5))) (and (= .cse10 .cse1) (= (select |c_#valid| .cse11) 1) (= 0 (select v_prenex_7 .cse11)) (= (select v_prenex_7 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_7 .cse1) 1))))) .cse6) (and (not (= .cse8 .cse1)) (or (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| .cse13) .cse15))) (and (= .cse13 .cse1) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_7 .cse14) 0))))) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= (select v_prenex_7 .cse1) 1))) (and (= .cse8 .cse3) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_prenex_7 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse17) 1) (= (select v_prenex_7 .cse8) 1) (= |c_#valid| (let ((.cse18 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse18 (select |c_#valid| .cse18)))) (= (select v_prenex_7 .cse17) 0) (= (select v_prenex_7 .cse1) 1))))) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse19) 1) (= .cse19 .cse3) (= (select v_prenex_7 .cse19) 0)))) (= |c_#valid| (let ((.cse20 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse20 (select |c_#valid| .cse20)))) (= (select v_prenex_7 .cse1) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse21) .cse5))) (and (= .cse21 .cse1) (= (select |c_#valid| .cse22) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse22) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse23 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse23 (select |c_#valid| .cse23)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_arrayElimCell_119 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| .cse24) .cse15))) (and (= .cse24 .cse1) (= .cse25 .cse8) (= (select |v_old(#valid)_AFTER_CALL_47| .cse25) 0) (= (select |c_#valid| .cse25) 1) (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_119) 1) (not (= v_arrayElimCell_119 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse26 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse26 (select |c_#valid| .cse26))))))))))))) is different from true [2024-11-28 04:40:50,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:50,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 869 treesize of output 1057 [2024-11-28 04:40:50,543 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 629 treesize of output 513 [2024-11-28 04:40:59,195 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_#t~mem16#1.offset|)) (.cse2 (select .cse17 (+ |c_ULTIMATE.start_main_#t~mem16#1.offset| 4)))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2))) (.cse1 (= (select |c_#valid| .cse4) 1)) (.cse8 (= 1 (select |c_#valid| .cse2))) (.cse7 (= .cse2 .cse4))) (or (and .cse0 .cse1 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 .cse2) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse0 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_29 .cse2) 1) (= (select v_prenex_29 .cse6) 0) (= (select |c_#valid| .cse6) 1) (= .cse6 .cse4))))) (and .cse7 .cse8 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse9 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse9 (select |c_#valid| .cse9)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 .cse2) 0) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_119))))) (and (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse10 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse10 (select |c_#valid| .cse10)))) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_120)) (= (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_27 .cse4) 0) (= (select v_prenex_27 v_arrayElimCell_120) 1))) .cse7 .cse1) (and .cse0 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse11 (select |c_#valid| .cse11))))))) (and (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse4)) (or (and .cse8 (exists ((v_prenex_19 (Array Int Int))) (and (= |c_#valid| (let ((.cse12 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_19 .cse4) 1) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1)))) (and .cse7 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse13 (select |c_#valid| .cse13)))) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse14) 0))))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse15) 1) (= (select v_prenex_7 .cse15) 0) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= .cse15 .cse2)))))))))) is different from false [2024-11-28 04:40:59,206 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_#t~mem16#1.offset|)) (.cse2 (select .cse17 (+ |c_ULTIMATE.start_main_#t~mem16#1.offset| 4)))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2))) (.cse1 (= (select |c_#valid| .cse4) 1)) (.cse8 (= 1 (select |c_#valid| .cse2))) (.cse7 (= .cse2 .cse4))) (or (and .cse0 .cse1 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 .cse2) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse0 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_29 .cse2) 1) (= (select v_prenex_29 .cse6) 0) (= (select |c_#valid| .cse6) 1) (= .cse6 .cse4))))) (and .cse7 .cse8 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse9 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse9 (select |c_#valid| .cse9)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 .cse2) 0) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_119))))) (and (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse10 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse10 (select |c_#valid| .cse10)))) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_120)) (= (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_27 .cse4) 0) (= (select v_prenex_27 v_arrayElimCell_120) 1))) .cse7 .cse1) (and .cse0 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse11 (select |c_#valid| .cse11))))))) (and (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse4)) (or (and .cse8 (exists ((v_prenex_19 (Array Int Int))) (and (= |c_#valid| (let ((.cse12 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_19 .cse4) 1) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1)))) (and .cse7 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse13 (select |c_#valid| .cse13)))) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse14) 0))))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse15) 1) (= (select v_prenex_7 .cse15) 0) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= .cse15 .cse2)))))))))) is different from true [2024-11-28 04:40:59,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse3 (select .cse17 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse1 (= .cse4 .cse3)) (.cse10 (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))) (.cse11 (= (select |c_#valid| .cse4) 1))) (or (and .cse0 .cse1 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_119)) (= (select v_prenex_32 .cse3) 0)))) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (or (and .cse0 (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_19 .cse3) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse6) 1) (= (select v_prenex_7 .cse6) 0) (= |c_#valid| (let ((.cse7 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse7 (select |c_#valid| .cse7)))) (= .cse6 .cse3) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (and .cse1 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= |c_#valid| (let ((.cse8 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse9) 0))))))) (and .cse10 .cse11 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_22 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse1 .cse11 (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse13 (select |c_#valid| .cse13)))) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 .cse4) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_120))))) (and .cse10 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse14 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse14 (select |c_#valid| .cse14)))) (= .cse15 .cse4) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_29 .cse15) 0) (= (select v_prenex_29 .cse3) 1) (= (select |c_#valid| .cse15) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse16 (select |c_#valid| .cse16)))))) .cse10 .cse11))))) is different from false [2024-11-28 04:40:59,845 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse3 (select .cse17 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse1 (= .cse4 .cse3)) (.cse10 (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))) (.cse11 (= (select |c_#valid| .cse4) 1))) (or (and .cse0 .cse1 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_119)) (= (select v_prenex_32 .cse3) 0)))) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (or (and .cse0 (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_19 .cse3) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse6) 1) (= (select v_prenex_7 .cse6) 0) (= |c_#valid| (let ((.cse7 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse7 (select |c_#valid| .cse7)))) (= .cse6 .cse3) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (and .cse1 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= |c_#valid| (let ((.cse8 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse9) 0))))))) (and .cse10 .cse11 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_22 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse1 .cse11 (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse13 (select |c_#valid| .cse13)))) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 .cse4) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_120))))) (and .cse10 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse14 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse14 (select |c_#valid| .cse14)))) (= .cse15 .cse4) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_29 .cse15) 0) (= (select v_prenex_29 .cse3) 1) (= (select |c_#valid| .cse15) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse16 (select |c_#valid| .cse16)))))) .cse10 .cse11))))) is different from true [2024-11-28 04:41:00,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:00,477 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 502 treesize of output 424 [2024-11-28 04:41:01,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1))) (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse0 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse0 (select |c_#valid| .cse0)))) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|))))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) .cse1) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse5 (select |c_#valid| .cse5)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= 0 (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem18#1.base|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse6 (select |c_#valid| .cse6)))))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse7 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse7 (select |c_#valid| .cse7)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse8 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))))) is different from false [2024-11-28 04:41:05,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1))) (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse0 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse0 (select |c_#valid| .cse0)))) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|))))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) .cse1) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse5 (select |c_#valid| .cse5)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= 0 (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem18#1.base|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse6 (select |c_#valid| .cse6)))))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse7 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse7 (select |c_#valid| .cse7)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse8 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))))) is different from true [2024-11-28 04:41:06,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse0 (select |c_#valid| .cse0)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse3 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select |c_#valid| v_arrayElimCell_133) 1))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse5 (select |c_#valid| .cse5)))))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse6 (select |c_#valid| .cse6)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse7 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse7 (select |c_#valid| .cse7)))))) .cse1) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse8 (select |c_#valid| .cse8)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))))) is different from false [2024-11-28 04:41:10,077 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse0 (select |c_#valid| .cse0)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse3 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select |c_#valid| v_arrayElimCell_133) 1))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse5 (select |c_#valid| .cse5)))))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse6 (select |c_#valid| .cse6)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse7 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse7 (select |c_#valid| .cse7)))))) .cse1) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse8 (select |c_#valid| .cse8)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))))) is different from true [2024-11-28 04:41:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 04:41:10,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:13,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_3525 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3525)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-28 04:41:13,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_3525 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3525)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-28 04:41:13,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_3525 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3525)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-28 04:41:13,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_3525 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_3525)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-28 04:41:13,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (v_ArrVal_3533 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_3525 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| Int) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_3533) |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_3525)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|) 0)))) is different from false [2024-11-28 04:41:13,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342328498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:13,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:41:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 56 [2024-11-28 04:41:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375314838] [2024-11-28 04:41:13,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-28 04:41:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:13,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-28 04:41:13,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2215, Unknown=25, NotChecked=1620, Total=4032 [2024-11-28 04:41:13,201 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 57 states, 54 states have (on average 2.0) internal successors, (108), 50 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:41:14,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select .cse5 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (not (= .cse0 .cse1)) (= .cse3 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select .cse5 (+ .cse3 4))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) 1) (= (select |c_#valid| .cse0) 1))))) is different from false [2024-11-28 04:41:14,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select .cse5 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (not (= .cse0 .cse1)) (= .cse3 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select .cse5 (+ .cse3 4))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) 1) (= (select |c_#valid| .cse0) 1))))) is different from true [2024-11-28 04:41:14,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse3)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= .cse3 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select .cse5 (+ .cse3 4))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-28 04:41:14,437 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse3)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= .cse3 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select .cse5 (+ .cse3 4))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-28 04:41:14,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select .cse3 (+ .cse4 4))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-28 04:41:14,446 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select .cse3 (+ .cse4 4))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-28 04:41:14,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= .cse0 (select .cse3 (+ .cse4 4))) (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (and (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse4)) 1) .cse6 (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) .cse7) (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse4)) 1) .cse6 .cse7 (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| .cse5)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-28 04:41:14,455 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (not (= .cse0 .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))))) (= .cse0 (select .cse3 (+ .cse4 4))) (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (and (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse4)) 1) .cse6 (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) .cse7) (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse4)) 1) .cse6 .cse7 (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| .cse5)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-28 04:41:14,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse7 .cse1)) (.cse5 (select .cse7 (+ .cse1 4)))) (or (and (not (= .cse2 .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= .cse2 .cse5)))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1))) (not (= .cse3 .cse5))))))))) is different from false [2024-11-28 04:41:14,464 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select .cse7 .cse1)) (.cse5 (select .cse7 (+ .cse1 4)))) (or (and (not (= .cse2 .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= .cse2 .cse5)))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1))) (not (= .cse3 .cse5))))))))) is different from true [2024-11-28 04:41:14,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse6)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))) is different from false [2024-11-28 04:41:14,476 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse7) .cse6)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))) is different from true [2024-11-28 04:41:14,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) .cse6)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))) is different from false [2024-11-28 04:41:14,487 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse1 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))) (not (= .cse0 .cse1)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse0 .cse3))))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) .cse6)) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))) is different from true [2024-11-28 04:41:14,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse0 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse0) 1))) (not (= .cse1 .cse0)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse1 .cse3)))))) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse6)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|) |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse6)) 1))) is different from false [2024-11-28 04:41:14,498 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse5 .cse6)) (.cse3 (select .cse5 (+ .cse6 4)))) (or (and (= .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (not (= .cse0 .cse3))) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select v_prenex_7 .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse0) 1))) (not (= .cse1 .cse0)) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= .cse1 .cse3)))))) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse6)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|) |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse6)) 1))) is different from true [2024-11-28 04:41:14,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select .cse27 .cse5))) (and (let ((.cse15 (+ .cse5 4))) (let ((.cse3 (select .cse27 .cse15))) (let ((.cse6 (not (= .cse1 .cse3)))) (or (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5))) (and (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= .cse2 .cse3) (exists ((v_arrayElimCell_120 Int) (v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_120) 1) (= 0 (select v_prenex_7 .cse2)) (not (= v_arrayElimCell_120 .cse1)) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))))))) (and .cse6 (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse7) 1) (= .cse8 .cse7) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int) (v_prenex_7 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) .cse5))) (and (= .cse10 .cse1) (= (select |c_#valid| .cse11) 1) (= 0 (select v_prenex_7 .cse11)) (= (select v_prenex_7 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_7 .cse1) 1))))) .cse6) (and (not (= .cse8 .cse1)) (or (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| .cse13) .cse15))) (and (= .cse13 .cse1) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_7 .cse14) 0))))) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= (select v_prenex_7 .cse1) 1))) (and (= .cse8 .cse3) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_prenex_7 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse17) 1) (= (select v_prenex_7 .cse8) 1) (= |c_#valid| (let ((.cse18 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse18 (select |c_#valid| .cse18)))) (= (select v_prenex_7 .cse17) 0) (= (select v_prenex_7 .cse1) 1))))) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse19) 1) (= .cse19 .cse3) (= (select v_prenex_7 .cse19) 0)))) (= |c_#valid| (let ((.cse20 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse20 (select |c_#valid| .cse20)))) (= (select v_prenex_7 .cse1) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse21) .cse5))) (and (= .cse21 .cse1) (= (select |c_#valid| .cse22) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse22) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse23 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse23 (select |c_#valid| .cse23)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_arrayElimCell_119 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| .cse24) .cse15))) (and (= .cse24 .cse1) (= .cse25 .cse8) (= (select |v_old(#valid)_AFTER_CALL_47| .cse25) 0) (= (select |c_#valid| .cse25) 1) (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_119) 1) (not (= v_arrayElimCell_119 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse26 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse26 (select |c_#valid| .cse26)))))))))))) (= (select |c_#valid| .cse8) 1))))) is different from false [2024-11-28 04:41:14,539 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select .cse27 .cse5))) (and (let ((.cse15 (+ .cse5 4))) (let ((.cse3 (select .cse27 .cse15))) (let ((.cse6 (not (= .cse1 .cse3)))) (or (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5))) (and (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= .cse2 .cse3) (exists ((v_arrayElimCell_120 Int) (v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_120) 1) (= 0 (select v_prenex_7 .cse2)) (not (= v_arrayElimCell_120 .cse1)) (= |c_#valid| (let ((.cse4 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_7 .cse1) 1))))))) (and .cse6 (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse7) 1) (= .cse8 .cse7) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse9 (select |c_#valid| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int) (v_prenex_7 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) .cse5))) (and (= .cse10 .cse1) (= (select |c_#valid| .cse11) 1) (= 0 (select v_prenex_7 .cse11)) (= (select v_prenex_7 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_7 .cse1) 1))))) .cse6) (and (not (= .cse8 .cse1)) (or (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| .cse13) .cse15))) (and (= .cse13 .cse1) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_7 .cse14) 0))))) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= (select v_prenex_7 .cse1) 1))) (and (= .cse8 .cse3) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_prenex_7 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse17) 1) (= (select v_prenex_7 .cse8) 1) (= |c_#valid| (let ((.cse18 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse18 (select |c_#valid| .cse18)))) (= (select v_prenex_7 .cse17) 0) (= (select v_prenex_7 .cse1) 1))))) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 .cse8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select |c_#valid| .cse19) 1) (= .cse19 .cse3) (= (select v_prenex_7 .cse19) 0)))) (= |c_#valid| (let ((.cse20 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse20 (select |c_#valid| .cse20)))) (= (select v_prenex_7 .cse1) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse21) .cse5))) (and (= .cse21 .cse1) (= (select |c_#valid| .cse22) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse22) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse23 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse23 (select |c_#valid| .cse23)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))))) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.offset_20| Int) (v_arrayElimCell_119 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_25| Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_25|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_20|))) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| .cse24) .cse15))) (and (= .cse24 .cse1) (= .cse25 .cse8) (= (select |v_old(#valid)_AFTER_CALL_47| .cse25) 0) (= (select |c_#valid| .cse25) 1) (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_119) 1) (not (= v_arrayElimCell_119 .cse1)) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 1) (= |c_#valid| (let ((.cse26 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse26 (select |c_#valid| .cse26)))))))))))) (= (select |c_#valid| .cse8) 1))))) is different from true [2024-11-28 04:41:14,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_#t~mem16#1.offset|))) (let ((.cse0 (= (select |c_#valid| .cse4) 1))) (and .cse0 (let ((.cse2 (select .cse17 (+ |c_ULTIMATE.start_main_#t~mem16#1.offset| 4)))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2))) (.cse8 (= 1 (select |c_#valid| .cse2))) (.cse7 (= .cse2 .cse4))) (or (and .cse1 .cse0 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 .cse2) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse1 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_29 .cse2) 1) (= (select v_prenex_29 .cse6) 0) (= (select |c_#valid| .cse6) 1) (= .cse6 .cse4))))) (and .cse7 .cse8 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse9 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse9 (select |c_#valid| .cse9)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 .cse2) 0) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_119))))) (and (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse10 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse10 (select |c_#valid| .cse10)))) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_120)) (= (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_27 .cse4) 0) (= (select v_prenex_27 v_arrayElimCell_120) 1))) .cse7 .cse0) (and .cse1 .cse0 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse11 (select |c_#valid| .cse11))))))) (and (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse4)) (or (and .cse8 (exists ((v_prenex_19 (Array Int Int))) (and (= |c_#valid| (let ((.cse12 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_19 .cse4) 1) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1)))) (and .cse7 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse13 (select |c_#valid| .cse13)))) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse14) 0))))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse15) 1) (= (select v_prenex_7 .cse15) 0) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= .cse15 .cse2))))))))))))) is different from false [2024-11-28 04:41:14,961 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_#t~mem16#1.offset|))) (let ((.cse0 (= (select |c_#valid| .cse4) 1))) (and .cse0 (let ((.cse2 (select .cse17 (+ |c_ULTIMATE.start_main_#t~mem16#1.offset| 4)))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse2))) (.cse8 (= 1 (select |c_#valid| .cse2))) (.cse7 (= .cse2 .cse4))) (or (and .cse1 .cse0 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 .cse2) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse1 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_29 .cse2) 1) (= (select v_prenex_29 .cse6) 0) (= (select |c_#valid| .cse6) 1) (= .cse6 .cse4))))) (and .cse7 .cse8 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse9 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse9 (select |c_#valid| .cse9)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 .cse2) 0) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_119))))) (and (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse10 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse10 (select |c_#valid| .cse10)))) (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| v_arrayElimCell_120)) (= (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_27 .cse4) 0) (= (select v_prenex_27 v_arrayElimCell_120) 1))) .cse7 .cse0) (and .cse1 .cse0 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse11 (select |c_#valid| .cse11))))))) (and (not (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse4)) (or (and .cse8 (exists ((v_prenex_19 (Array Int Int))) (and (= |c_#valid| (let ((.cse12 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_19 .cse4) 1) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1)))) (and .cse7 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse13 (select |c_#valid| .cse13)))) (= (select |c_#valid| .cse14) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse14) 0))))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem16#1.base|) 1) (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse15) 1) (= (select v_prenex_7 .cse15) 0) (= |c_#valid| (let ((.cse16 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse16 (select |c_#valid| .cse16)))) (= .cse15 .cse2))))))))))))) is different from true [2024-11-28 04:41:15,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse11 (= (select |c_#valid| .cse4) 1))) (and (let ((.cse3 (select .cse17 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse1 (= .cse4 .cse3)) (.cse10 (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))) (or (and .cse0 .cse1 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_119)) (= (select v_prenex_32 .cse3) 0)))) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (or (and .cse0 (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_19 .cse3) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse6) 1) (= (select v_prenex_7 .cse6) 0) (= |c_#valid| (let ((.cse7 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse7 (select |c_#valid| .cse7)))) (= .cse6 .cse3) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (and .cse1 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= |c_#valid| (let ((.cse8 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse9) 0))))))) (and .cse10 .cse11 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_22 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse1 .cse11 (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse13 (select |c_#valid| .cse13)))) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 .cse4) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_120))))) (and .cse10 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse14 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse14 (select |c_#valid| .cse14)))) (= .cse15 .cse4) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_29 .cse15) 0) (= (select v_prenex_29 .cse3) 1) (= (select |c_#valid| .cse15) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse16 (select |c_#valid| .cse16)))))) .cse10 .cse11)))) .cse11)))) is different from false [2024-11-28 04:41:15,338 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse11 (= (select |c_#valid| .cse4) 1))) (and (let ((.cse3 (select .cse17 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse1 (= .cse4 .cse3)) (.cse10 (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))) (or (and .cse0 .cse1 (exists ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_119)) (= (select v_prenex_32 .cse3) 0)))) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (or (and .cse0 (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse5 (select |c_#valid| .cse5)))) (= (select v_prenex_19 .cse3) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_arrayElimCell_129 Int) (v_prenex_7 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_129) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4)))) (and (= (select v_prenex_7 .cse4) 1) (= (select |c_#valid| .cse6) 1) (= (select v_prenex_7 .cse6) 0) (= |c_#valid| (let ((.cse7 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse7 (select |c_#valid| .cse7)))) (= .cse6 .cse3) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (and .cse1 (exists ((v_prenex_13 Int) (v_arrayElimCell_123 Int) (v_prenex_16 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_123) (+ v_prenex_13 4)))) (and (= |c_#valid| (let ((.cse8 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |c_#valid| .cse9) 1) (= (select v_prenex_16 .cse4) 1) (= (select v_prenex_16 .cse9) 0))))))) (and .cse10 .cse11 (exists ((v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_22 .cse3) 1) (= |c_#valid| (let ((.cse12 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse12 (select |c_#valid| .cse12)))) (= (select v_prenex_22 .cse4) 0)))) (and .cse1 .cse11 (exists ((v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |c_#valid| (let ((.cse13 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse13 (select |c_#valid| .cse13)))) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 .cse4) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimCell_120))))) (and .cse10 (exists ((v_prenex_28 Int) (v_arrayElimCell_121 Int) (v_prenex_29 (Array Int Int))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_121) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse14 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse14 (select |c_#valid| .cse14)))) (= .cse15 .cse4) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_29 .cse15) 0) (= (select v_prenex_29 .cse3) 1) (= (select |c_#valid| .cse15) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= |c_#valid| (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse16 (select |c_#valid| .cse16)))))) .cse10 .cse11)))) .cse11)))) is different from true [2024-11-28 04:41:15,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1))) (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse1 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse1 (select |c_#valid| .cse1)))) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse5 (select |c_#valid| .cse5)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= 0 (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem18#1.base|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse6 (select |c_#valid| .cse6)))))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse7 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse7 (select |c_#valid| .cse7)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse8 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))))) is different from false [2024-11-28 04:41:15,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem18#1.base|) 1))) (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse1 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse1 (select |c_#valid| .cse1)))) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse3 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse3 (select |c_#valid| .cse3))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse4 (select |c_#valid| .cse4)))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse5 (select |c_#valid| .cse5)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= 0 (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem18#1.base|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_19 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= |c_#valid| (let ((.cse6 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse6 (select |c_#valid| .cse6)))))))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse7 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse7 (select |c_#valid| .cse7)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_#t~mem18#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse8 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse8 (select |c_#valid| .cse8)))) (= (select v_prenex_32 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))))) is different from true [2024-11-28 04:41:16,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (and (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse0 (select |c_#valid| .cse0)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse3 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select |c_#valid| v_arrayElimCell_133) 1))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse5 (select |c_#valid| .cse5)))))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse6 (select |c_#valid| .cse6)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse7 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse7 (select |c_#valid| .cse7)))))) .cse1) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse8 (select |c_#valid| .cse8)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))) .cse1)) is different from false [2024-11-28 04:41:16,325 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (and (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_29 (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff v_prenex_29 |c_#valid|))) (store v_prenex_29 .cse0 (select |c_#valid| .cse0)))) (= (select v_prenex_29 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select v_prenex_29 v_arrayElimCell_133)) (= (select v_prenex_29 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_prenex_32 (Array Int Int)) (v_arrayElimCell_119 Int)) (and (not (= v_arrayElimCell_119 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse2 (@diff v_prenex_32 |c_#valid|))) (store v_prenex_32 .cse2 (select |c_#valid| .cse2)))) (= (select v_prenex_32 v_arrayElimCell_119) 1) (= (select v_prenex_32 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_32 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (exists ((v_prenex_7 (Array Int Int))) (and (= (select v_prenex_7 v_arrayElimCell_133) 0) (= |c_#valid| (let ((.cse3 (@diff v_prenex_7 |c_#valid|))) (store v_prenex_7 .cse3 (select |c_#valid| .cse3)))) (= (select v_prenex_7 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select |c_#valid| v_arrayElimCell_133) 1))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (exists ((v_arrayElimCell_133 Int)) (and (= (select |c_#valid| v_arrayElimCell_133) 1) (exists ((v_prenex_19 (Array Int Int))) (and (= (select v_prenex_19 v_arrayElimCell_133) 0) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= |c_#valid| (let ((.cse4 (@diff v_prenex_19 |c_#valid|))) (store v_prenex_19 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))))))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_arrayElimCell_133) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_47| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_47| .cse5 (select |c_#valid| .cse5)))))) .cse1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int)) (and (exists ((v_arrayElimCell_131 Int) (v_prenex_16 (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff v_prenex_16 |c_#valid|))) (store v_prenex_16 .cse6 (select |c_#valid| .cse6)))) (= (select |c_#valid| v_arrayElimCell_131) 1) (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_16 v_arrayElimCell_131) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_16|)))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_133 Int) (v_prenex_22 (Array Int Int))) (and (= (select v_prenex_22 v_arrayElimCell_133) 1) (= (select v_prenex_22 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1) (= (select v_prenex_22 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= v_arrayElimCell_133 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= |c_#valid| (let ((.cse7 (@diff v_prenex_22 |c_#valid|))) (store v_prenex_22 .cse7 (select |c_#valid| .cse7)))))) .cse1) (and .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_16| Int) (v_arrayElimCell_120 Int) (v_prenex_27 (Array Int Int))) (and (= (select v_prenex_27 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse8 (select |c_#valid| .cse8)))) (not (= v_arrayElimCell_120 |v_ULTIMATE.start_main_~ptr~0#1.base_16|)) (= (select v_prenex_27 v_arrayElimCell_120) 1) (= (select v_prenex_27 |v_ULTIMATE.start_main_~ptr~0#1.base_16|) 1))))) .cse1)) is different from true [2024-11-28 04:41:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:16,704 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-28 04:41:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 04:41:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 2.0) internal successors, (108), 50 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 65 [2024-11-28 04:41:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:16,705 INFO L225 Difference]: With dead ends: 104 [2024-11-28 04:41:16,705 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 04:41:16,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=270, Invalid=3331, Unknown=51, NotChecked=4004, Total=7656 [2024-11-28 04:41:16,707 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 3397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2189 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:16,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1322 Invalid, 3397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1195 Invalid, 0 Unknown, 2189 Unchecked, 1.0s Time] [2024-11-28 04:41:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 04:41:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-11-28 04:41:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 04:41:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-28 04:41:16,712 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 65 [2024-11-28 04:41:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:16,712 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-28 04:41:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 2.0) internal successors, (108), 50 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:41:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-28 04:41:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:41:16,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:16,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 04:41:16,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:41:16,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:16,914 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-28 04:41:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1162205359, now seen corresponding path program 1 times [2024-11-28 04:41:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198460052] [2024-11-28 04:41:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198460052] [2024-11-28 04:41:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198460052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341185296] [2024-11-28 04:41:22,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:22,505 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:22,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f6727b6-bf60-44d6-9cda-ebcc316a3b9d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:41:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:22,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 164 conjuncts are in the unsatisfiable core [2024-11-28 04:41:22,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:22,948 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-28 04:41:22,951 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-28 04:41:23,246 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:41:23,246 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-28 04:41:23,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:41:23,267 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-28 04:41:23,498 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 11 treesize of output 7 [2024-11-28 04:41:23,513 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 11 treesize of output 7 [2024-11-28 04:41:23,683 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:41:23,683 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-28 04:41:23,693 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 24 treesize of output 11 [2024-11-28 04:41:23,963 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:41:23,963 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 04:41:23,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:41:23,978 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 16 treesize of output 11 [2024-11-28 04:41:24,019 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 23 treesize of output 11 [2024-11-28 04:41:24,025 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 33 treesize of output 24 [2024-11-28 04:41:24,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2024-11-28 04:41:24,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-11-28 04:41:24,409 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 11 treesize of output 3 [2024-11-28 04:41:24,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-28 04:41:25,320 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:41:25,320 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 04:41:25,363 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 04:41:25,363 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 1 case distinctions, treesize of input 57 treesize of output 42 [2024-11-28 04:41:25,390 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-28 04:41:25,390 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 16 treesize of output 17 [2024-11-28 04:41:25,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-28 04:41:25,450 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 04:41:25,451 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 15 treesize of output 15 [2024-11-28 04:41:26,627 INFO L349 Elim1Store]: treesize reduction 98, result has 32.4 percent of original size [2024-11-28 04:41:26,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 71 [2024-11-28 04:41:26,702 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-28 04:41:26,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 70 [2024-11-28 04:41:27,296 INFO L349 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2024-11-28 04:41:27,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 269 treesize of output 264 [2024-11-28 04:41:27,364 INFO L349 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2024-11-28 04:41:27,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 226 treesize of output 209 [2024-11-28 04:41:27,517 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 11 treesize of output 3 [2024-11-28 04:41:28,023 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 3 [2024-11-28 04:41:28,050 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 3 [2024-11-28 04:41:29,016 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 3 [2024-11-28 04:41:29,044 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:41:29,058 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 3 [2024-11-28 04:41:29,156 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:41:29,776 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 11 treesize of output 3 [2024-11-28 04:41:29,795 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 31 treesize of output 15 [2024-11-28 04:41:29,823 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 31 treesize of output 15 [2024-11-28 04:41:29,871 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 11 treesize of output 3 [2024-11-28 04:41:29,908 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 11 treesize of output 3 [2024-11-28 04:41:29,939 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:41:31,209 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2024-11-28 04:41:31,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 319 treesize of output 307 [2024-11-28 04:41:31,220 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 296 treesize of output 201 [2024-11-28 04:41:31,341 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:41:31,348 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-28 04:41:32,440 INFO L349 Elim1Store]: treesize reduction 62, result has 44.1 percent of original size [2024-11-28 04:41:32,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 452 treesize of output 353 [2024-11-28 04:41:32,704 INFO L349 Elim1Store]: treesize reduction 132, result has 63.4 percent of original size [2024-11-28 04:41:32,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 329 treesize of output 501 [2024-11-28 04:43:05,552 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 880 DAG size of output: 915 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:49:04,900 WARN L286 SmtUtils]: Spent 2.39m on a formula simplification. DAG size of input: 3492 DAG size of output: 3491 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)