./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:05:55,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:05:55,787 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:05:55,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:05:55,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:05:55,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:05:55,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:05:55,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:05:55,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:05:55,821 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:05:55,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:05:55,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:05:55,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:05:55,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:05:55,824 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:05:55,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:05:55,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:05:55,826 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:05:55,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:05:55,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:05:55,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:05:55,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:05:55,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:05:55,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:05:55,829 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:05:55,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:05:55,830 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:05:55,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:05:55,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:05:55,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:05:55,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:05:55,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:55,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:05:55,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:05:55,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:05:55,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:05:55,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:05:55,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:05:55,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:05:55,834 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:05:55,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:05:55,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:05:55,835 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme 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 ! call(reach_error())) ) 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2023-11-26 12:05:56,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:05:56,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:05:56,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:05:56,100 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:05:56,101 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:05:56,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-26 12:05:59,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:05:59,595 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:05:59,595 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-26 12:05:59,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/data/ee2a46cab/42719f6e731e43b491617af78ed4731d/FLAG2d4332589 [2023-11-26 12:05:59,646 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/data/ee2a46cab/42719f6e731e43b491617af78ed4731d [2023-11-26 12:05:59,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:05:59,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:05:59,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:59,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:05:59,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:05:59,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:59" (1/1) ... [2023-11-26 12:05:59,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640d381a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:59, skipping insertion in model container [2023-11-26 12:05:59,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:59" (1/1) ... [2023-11-26 12:05:59,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:06:00,094 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-26 12:06:00,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:06:00,121 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:06:00,224 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-26 12:06:00,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:06:00,284 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:06:00,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00 WrapperNode [2023-11-26 12:06:00,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:06:00,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:06:00,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:06:00,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:06:00,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,383 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-26 12:06:00,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:06:00,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:06:00,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:06:00,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:06:00,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,435 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 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]. [2023-11-26 12:06:00,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:06:00,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:06:00,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:06:00,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:06:00,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (1/1) ... [2023-11-26 12:06:00,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:06:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:06:00,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:06:00,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:06:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 12:06:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 12:06:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 12:06:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:06:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:06:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:06:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-26 12:06:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-26 12:06:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 12:06:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:06:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:06:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:06:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-26 12:06:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-26 12:06:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-26 12:06:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:06:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:06:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:06:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:06:00,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:06:00,717 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:06:00,719 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:06:00,987 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:06:01,071 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:06:01,071 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-26 12:06:01,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:01 BoogieIcfgContainer [2023-11-26 12:06:01,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:06:01,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:06:01,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:06:01,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:06:01,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:59" (1/3) ... [2023-11-26 12:06:01,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298e3357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:06:01, skipping insertion in model container [2023-11-26 12:06:01,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:00" (2/3) ... [2023-11-26 12:06:01,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298e3357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:06:01, skipping insertion in model container [2023-11-26 12:06:01,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:01" (3/3) ... [2023-11-26 12:06:01,086 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-26 12:06:01,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:06:01,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:06:01,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:06:01,177 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7adcd3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:06:01,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:06:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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) [2023-11-26 12:06:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-26 12:06:01,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:06:01,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:01,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:06:01,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-11-26 12:06:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:06:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455801942] [2023-11-26 12:06:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:06:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:06:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:06:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 12:06:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:06:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455801942] [2023-11-26 12:06:01,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455801942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:01,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:06:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882927656] [2023-11-26 12:06:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:01,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:06:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:06:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:06:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:06:01,729 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 12:06:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:06:01,840 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-11-26 12:06:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:06:01,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-26 12:06:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:06:01,850 INFO L225 Difference]: With dead ends: 54 [2023-11-26 12:06:01,850 INFO L226 Difference]: Without dead ends: 24 [2023-11-26 12:06:01,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:06:01,860 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:06:01,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:06:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-26 12:06:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-26 12:06:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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) [2023-11-26 12:06:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-26 12:06:01,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-11-26 12:06:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:06:01,904 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-26 12:06:01,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 12:06:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-26 12:06:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-26 12:06:01,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:06:01,908 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:01,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:06:01,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:06:01,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-11-26 12:06:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:06:01,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84235386] [2023-11-26 12:06:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:06:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:06:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 12:06:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 12:06:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:06:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84235386] [2023-11-26 12:06:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84235386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:06:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367693703] [2023-11-26 12:06:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:02,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:06:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:06:02,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:06:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:06:02,272 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 12:06:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:06:02,356 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-11-26 12:06:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:06:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-26 12:06:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:06:02,359 INFO L225 Difference]: With dead ends: 45 [2023-11-26 12:06:02,359 INFO L226 Difference]: Without dead ends: 29 [2023-11-26 12:06:02,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:06:02,362 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:06:02,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:06:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-26 12:06:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-11-26 12:06:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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) [2023-11-26 12:06:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-26 12:06:02,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-11-26 12:06:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:06:02,374 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-26 12:06:02,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 12:06:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-26 12:06:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 12:06:02,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:06:02,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:02,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:06:02,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:06:02,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-11-26 12:06:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:06:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716122878] [2023-11-26 12:06:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:06:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:06:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:06:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 12:06:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 12:06:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:06:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716122878] [2023-11-26 12:06:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716122878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:06:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536982754] [2023-11-26 12:06:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:03,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:06:03,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:06:03,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:06:03,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 12:06:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:03,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-26 12:06:03,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:03,672 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 [2023-11-26 12:06:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 12:06:03,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:06:03,748 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 8 treesize of output 4 [2023-11-26 12:06:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 12:06:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536982754] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:06:03,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:06:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-26 12:06:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40448982] [2023-11-26 12:06:03,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:06:03,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-26 12:06:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:06:03,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-26 12:06:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-11-26 12:06:03,840 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-26 12:06:07,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:11,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:15,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:20,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:24,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:28,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:32,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 12:06:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:06:32,524 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2023-11-26 12:06:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 12:06:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 26 [2023-11-26 12:06:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:06:32,526 INFO L225 Difference]: With dead ends: 53 [2023-11-26 12:06:32,526 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 12:06:32,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-11-26 12:06:32,528 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:06:32,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 265 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 7 Unknown, 0 Unchecked, 28.5s Time] [2023-11-26 12:06:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 12:06:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-26 12:06:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 12:06:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-26 12:06:32,543 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2023-11-26 12:06:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:06:32,544 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-26 12:06:32,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-26 12:06:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-26 12:06:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 12:06:32,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:06:32,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:32,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 12:06:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:06:32,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:06:32,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-11-26 12:06:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:06:32,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112081256] [2023-11-26 12:06:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:06:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:06:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:06:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 12:06:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 12:06:35,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:06:35,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112081256] [2023-11-26 12:06:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112081256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:06:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043672382] [2023-11-26 12:06:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:06:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:06:35,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:06:35,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 12:06:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:36,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-26 12:06:36,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:36,791 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 [2023-11-26 12:06:37,050 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 [2023-11-26 12:06:37,157 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-26 12:06:37,157 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 [2023-11-26 12:06:37,257 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 [2023-11-26 12:06:37,371 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 [2023-11-26 12:06:37,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:37,603 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 38 treesize of output 34 [2023-11-26 12:06:37,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-26 12:06:37,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:37,624 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 50 treesize of output 39 [2023-11-26 12:06:37,631 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 26 treesize of output 15 [2023-11-26 12:06:37,734 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 14 [2023-11-26 12:06:37,741 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 [2023-11-26 12:06:37,747 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 [2023-11-26 12:06:38,030 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-26 12:06:38,031 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 [2023-11-26 12:06:38,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:38,067 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 38 treesize of output 27 [2023-11-26 12:06:38,091 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-26 12:06:38,092 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 28 treesize of output 30 [2023-11-26 12:06:38,386 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 84 treesize of output 52 [2023-11-26 12:06:38,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:38,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:38,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 36 [2023-11-26 12:06:38,400 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 26 treesize of output 15 [2023-11-26 12:06:38,486 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 [2023-11-26 12:06:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:06:38,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:06:42,907 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int)) (v_DerPreprocessor_1 Int) (v_ArrVal_675 (Array Int Int))) (= |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|)) (.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|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_675) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_673))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_1)))) (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|))))) is different from false [2023-11-26 12:06:43,009 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| Int) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_DerPreprocessor_1 Int) (v_ArrVal_675 (Array Int Int))) (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|)) (.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|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_684) .cse1) .cse2) v_ArrVal_675) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_673))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_1)))) (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|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16|) 0)))) is different from false [2023-11-26 12:06:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043672382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:06:43,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 12:06:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-11-26 12:06:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37121818] [2023-11-26 12:06:43,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 12:06:43,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-26 12:06:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:06:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-26 12:06:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1734, Unknown=24, NotChecked=170, Total=2070 [2023-11-26 12:06:43,016 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 12:06:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:06:44,964 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-11-26 12:06:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-26 12:06:44,967 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-26 12:06:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:06:44,968 INFO L225 Difference]: With dead ends: 55 [2023-11-26 12:06:44,968 INFO L226 Difference]: Without dead ends: 53 [2023-11-26 12:06:44,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=252, Invalid=2924, Unknown=24, NotChecked=222, Total=3422 [2023-11-26 12:06:44,971 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:06:44,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-26 12:06:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-26 12:06:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-11-26 12:06:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-26 12:06:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-11-26 12:06:44,985 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2023-11-26 12:06:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:06:44,986 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-26 12:06:44,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 12:06:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-11-26 12:06:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 12:06:44,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:06:44,988 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:06:45,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-26 12:06:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:06:45,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:06:45,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2023-11-26 12:06:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:06:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836540867] [2023-11-26 12:06:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:06:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 12:06:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:06:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 12:06:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 12:06:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:06:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836540867] [2023-11-26 12:06:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836540867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:06:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257981725] [2023-11-26 12:06:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:49,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:06:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:06:49,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:06:49,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0417424-d9e4-4839-b3a2-456c0e5727fa/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 12:06:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:50,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-26 12:06:50,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:50,209 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 [2023-11-26 12:06:50,559 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2023-11-26 12:06:50,564 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2023-11-26 12:06:50,608 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 [2023-11-26 12:06:50,623 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2023-11-26 12:06:50,626 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2023-11-26 12:06:50,658 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 12:06:50,659 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 33 treesize of output 32 [2023-11-26 12:06:50,684 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2023-11-26 12:06:50,687 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2023-11-26 12:06:50,718 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from false [2023-11-26 12:06:50,721 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from true [2023-11-26 12:06:50,821 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-26 12:06:50,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 104 [2023-11-26 12:06:50,832 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 104 treesize of output 94 [2023-11-26 12:06:50,857 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 0 case distinctions, treesize of input 91 treesize of output 38 [2023-11-26 12:06:50,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))))))) is different from false [2023-11-26 12:06:50,903 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))))))) is different from true [2023-11-26 12:06:50,921 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 33 treesize of output 9 [2023-11-26 12:06:50,950 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-11-26 12:06:50,953 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-11-26 12:06:50,990 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-11-26 12:06:50,993 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-11-26 12:06:51,033 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-11-26 12:06:51,036 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-11-26 12:06:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:51,100 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 41 treesize of output 24 [2023-11-26 12:06:51,149 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse3 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2023-11-26 12:06:51,154 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse3 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2023-11-26 12:06:51,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2023-11-26 12:06:51,255 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2023-11-26 12:06:51,314 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 [2023-11-26 12:06:51,323 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-26 12:06:51,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 44 [2023-11-26 12:06:51,401 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 [2023-11-26 12:06:51,408 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-26 12:06:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:51,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 54 [2023-11-26 12:06:51,478 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 [2023-11-26 12:06:51,484 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-26 12:06:51,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 56 [2023-11-26 12:06:51,537 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-26 12:06:51,547 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 431 treesize of output 343 [2023-11-26 12:06:51,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 12:06:51,603 INFO L349 Elim1Store]: treesize reduction 223, result has 4.7 percent of original size [2023-11-26 12:06:51,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 375 treesize of output 89 [2023-11-26 12:06:51,863 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3))))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))))))) is different from false [2023-11-26 12:06:51,870 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3))))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))))))) is different from true [2023-11-26 12:06:52,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3)))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) is different from false [2023-11-26 12:06:52,226 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3)))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) is different from true [2023-11-26 12:06:52,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 12:06:52,624 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 394 treesize of output 282 [2023-11-26 12:06:52,809 INFO L349 Elim1Store]: treesize reduction 104, result has 32.0 percent of original size [2023-11-26 12:06:52,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 264 treesize of output 191 [2023-11-26 12:06:52,856 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-26 12:06:52,857 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 15 treesize of output 7 [2023-11-26 12:06:53,623 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_43)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_43) 1))) (exists ((v_arrayElimCell_43 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (and (= v_prenex_7 (let ((.cse1 (@diff v_prenex_5 v_prenex_7))) (store v_prenex_5 .cse1 (select v_prenex_7 .cse1)))) (= (select v_prenex_7 v_arrayElimCell_43) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_5 v_arrayElimCell_43) 0)))) is different from false [2023-11-26 12:06:53,628 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_43)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_43) 1))) (exists ((v_arrayElimCell_43 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (and (= v_prenex_7 (let ((.cse1 (@diff v_prenex_5 v_prenex_7))) (store v_prenex_5 .cse1 (select v_prenex_7 .cse1)))) (= (select v_prenex_7 v_arrayElimCell_43) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_5 v_arrayElimCell_43) 0)))) is different from true [2023-11-26 12:06:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-26 12:06:53,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:06:53,805 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 582 treesize of output 470