./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya --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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:48:03,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:48:03,851 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:48:03,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:48:03,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:48:03,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:48:03,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:48:03,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:48:03,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:48:03,879 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:48:03,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:48:03,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:48:03,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:48:03,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:48:03,882 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:48:03,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:48:03,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:48:03,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:48:03,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:48:03,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:48:03,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:48:03,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:48:03,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:48:03,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:48:03,886 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:48:03,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:48:03,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:48:03,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:48:03,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:48:03,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:48:03,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:48:03,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:48:03,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:48:03,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:48:03,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:48:03,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:48:03,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:48:03,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:48:03,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:48:03,891 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:48:03,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:48:03,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:48:03,891 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_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/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_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2023-11-29 04:48:04,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:48:04,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:48:04,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:48:04,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:48:04,107 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:48:04,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-29 04:48:06,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:48:07,110 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:48:07,111 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-29 04:48:07,126 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data/4225289d1/6335a4ae493b44fe8ab760453f700dd6/FLAGfcbdd933a [2023-11-29 04:48:07,411 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data/4225289d1/6335a4ae493b44fe8ab760453f700dd6 [2023-11-29 04:48:07,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:48:07,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:48:07,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:48:07,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:48:07,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:48:07,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59190781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07, skipping insertion in model container [2023-11-29 04:48:07,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,461 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:48:07,704 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_bd59078e-8afb-4d01-93e2-a1e52158da8b/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-11-29 04:48:07,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:48:07,716 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:48:07,760 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_bd59078e-8afb-4d01-93e2-a1e52158da8b/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-11-29 04:48:07,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:48:07,787 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:48:07,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07 WrapperNode [2023-11-29 04:48:07,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:48:07,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:48:07,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:48:07,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:48:07,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,829 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2023-11-29 04:48:07,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:48:07,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:48:07,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:48:07,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:48:07,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,864 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2023-11-29 04:48:07,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:48:07,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:48:07,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:48:07,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:48:07,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (1/1) ... [2023-11-29 04:48:07,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:48:07,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:07,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:48:07,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:48:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:48:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:48:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:48:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:48:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:48:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:48:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 04:48:07,946 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:48:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:48:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:48:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:48:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:48:07,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:48:08,085 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:48:08,087 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:48:08,337 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:48:08,370 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:48:08,370 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 04:48:08,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:48:08 BoogieIcfgContainer [2023-11-29 04:48:08,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:48:08,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:48:08,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:48:08,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:48:08,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:48:07" (1/3) ... [2023-11-29 04:48:08,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e72f90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:48:08, skipping insertion in model container [2023-11-29 04:48:08,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:48:07" (2/3) ... [2023-11-29 04:48:08,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e72f90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:48:08, skipping insertion in model container [2023-11-29 04:48:08,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:48:08" (3/3) ... [2023-11-29 04:48:08,378 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-11-29 04:48:08,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:48:08,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:48:08,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:48:08,438 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;@112fa5ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:48:08,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:48:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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-29 04:48:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:48:08,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:08,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:08,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:08,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2023-11-29 04:48:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502644461] [2023-11-29 04:48:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:08,804 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-29 04:48:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502644461] [2023-11-29 04:48:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502644461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:48:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:48:08,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:48:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860845527] [2023-11-29 04:48:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:48:08,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:48:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:48:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:48:08,838 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-29 04:48:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:08,918 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2023-11-29 04:48:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:48:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-11-29 04:48:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:08,926 INFO L225 Difference]: With dead ends: 66 [2023-11-29 04:48:08,926 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 04:48:08,929 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-29 04:48:08,932 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:08,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:48:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 04:48:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 04:48:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-29 04:48:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-29 04:48:08,962 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2023-11-29 04:48:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:08,963 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-29 04:48:08,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-29 04:48:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-29 04:48:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:48:08,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:08,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:48:08,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:08,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2023-11-29 04:48:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968072666] [2023-11-29 04:48:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:09,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:09,146 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-29 04:48:09,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:09,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968072666] [2023-11-29 04:48:09,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968072666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:48:09,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:48:09,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:48:09,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989063866] [2023-11-29 04:48:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:48:09,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:48:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:09,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:48:09,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:48:09,150 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:48:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:09,231 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-11-29 04:48:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:48:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 04:48:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:09,232 INFO L225 Difference]: With dead ends: 45 [2023-11-29 04:48:09,233 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:48:09,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-29 04:48:09,235 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:09,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:48:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:48:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-29 04:48:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-29 04:48:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-11-29 04:48:09,242 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 19 [2023-11-29 04:48:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:09,243 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-11-29 04:48:09,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:48:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-11-29 04:48:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:48:09,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:09,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:09,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:48:09,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:09,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1537362706, now seen corresponding path program 1 times [2023-11-29 04:48:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603127336] [2023-11-29 04:48:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:48:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603127336] [2023-11-29 04:48:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603127336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:48:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:48:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:48:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526216788] [2023-11-29 04:48:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:48:09,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:48:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:09,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:48:09,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:48:09,422 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-29 04:48:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:09,501 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-29 04:48:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:48:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 20 [2023-11-29 04:48:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:09,503 INFO L225 Difference]: With dead ends: 57 [2023-11-29 04:48:09,503 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:48:09,503 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-29 04:48:09,505 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:09,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:48:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:48:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 04:48:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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-29 04:48:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-11-29 04:48:09,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2023-11-29 04:48:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:09,512 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-11-29 04:48:09,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-29 04:48:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-11-29 04:48:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:48:09,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:09,514 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] [2023-11-29 04:48:09,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:48:09,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:09,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2023-11-29 04:48:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580965495] [2023-11-29 04:48:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:48:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:48:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:48:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580965495] [2023-11-29 04:48:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580965495] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384755036] [2023-11-29 04:48:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:11,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:11,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:11,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:48:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:12,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-29 04:48:12,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:12,576 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-29 04:48:12,818 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-29 04:48:12,922 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:48:12,922 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-29 04:48:13,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:13,027 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-29 04:48:13,131 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-29 04:48:13,146 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-29 04:48:13,406 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-29 04:48:13,406 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 183 treesize of output 163 [2023-11-29 04:48:13,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:13,426 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 44 treesize of output 33 [2023-11-29 04:48:13,460 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 98 treesize of output 75 [2023-11-29 04:48:13,493 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-29 04:48:13,646 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:48:13,647 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 55 [2023-11-29 04:48:13,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-29 04:48:13,664 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-29 04:48:13,669 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-29 04:48:13,933 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 04:48:13,934 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-29 04:48:13,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:13,964 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 04:48:13,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 69 [2023-11-29 04:48:13,987 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 04:48:13,987 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-29 04:48:14,243 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 40 treesize of output 16 [2023-11-29 04:48:14,426 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 39 treesize of output 15 [2023-11-29 04:48:14,432 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 25 treesize of output 15 [2023-11-29 04:48:14,533 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-29 04:48:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:48:14,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:14,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (not (= v_ArrVal_564 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_564 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_562) (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-29 04:48:14,765 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_564 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) v_ArrVal_564)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_563) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_562) (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-29 04:48:14,785 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_563) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_562) (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|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_564 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_564 .cse1))))))) is different from false [2023-11-29 04:48:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384755036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:14,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-11-29 04:48:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306320387] [2023-11-29 04:48:14,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 04:48:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 04:48:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1925, Unknown=3, NotChecked=270, Total=2352 [2023-11-29 04:48:14,965 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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-29 04:48:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:17,933 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2023-11-29 04:48:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 04:48:17,934 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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 28 [2023-11-29 04:48:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:17,935 INFO L225 Difference]: With dead ends: 79 [2023-11-29 04:48:17,935 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 04:48:17,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=352, Invalid=4213, Unknown=3, NotChecked=402, Total=4970 [2023-11-29 04:48:17,939 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 108 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:17,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 434 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1201 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 04:48:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 04:48:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2023-11-29 04:48:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:48:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-11-29 04:48:17,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 28 [2023-11-29 04:48:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:17,953 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-11-29 04:48:17,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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-29 04:48:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-11-29 04:48:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:48:17,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:17,955 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-29 04:48:17,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:48:18,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:18,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:18,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1828890171, now seen corresponding path program 1 times [2023-11-29 04:48:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172819777] [2023-11-29 04:48:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:48:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:48:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:48:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172819777] [2023-11-29 04:48:18,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172819777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:48:18,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:48:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:48:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358103456] [2023-11-29 04:48:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:48:18,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:48:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:48:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:48:18,360 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:48:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:18,438 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2023-11-29 04:48:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:48:18,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-29 04:48:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:18,439 INFO L225 Difference]: With dead ends: 55 [2023-11-29 04:48:18,439 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 04:48:18,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:48:18,441 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:18,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:48:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 04:48:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-29 04:48:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:48:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2023-11-29 04:48:18,450 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 29 [2023-11-29 04:48:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:18,450 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2023-11-29 04:48:18,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:48:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2023-11-29 04:48:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:48:18,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:18,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:18,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:48:18,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:18,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958037, now seen corresponding path program 2 times [2023-11-29 04:48:18,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:18,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680257889] [2023-11-29 04:48:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:48:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:48:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:48:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680257889] [2023-11-29 04:48:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680257889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:48:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:48:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:48:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747867062] [2023-11-29 04:48:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:48:18,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:48:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:48:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:48:18,649 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:48:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:18,727 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-11-29 04:48:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:48:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-29 04:48:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:18,728 INFO L225 Difference]: With dead ends: 54 [2023-11-29 04:48:18,728 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 04:48:18,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:48:18,729 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:18,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:48:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 04:48:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-29 04:48:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:48:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-11-29 04:48:18,738 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 29 [2023-11-29 04:48:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:18,738 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-29 04:48:18,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:48:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2023-11-29 04:48:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:48:18,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:18,739 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, 1] [2023-11-29 04:48:18,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:48:18,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:18,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1486153936, now seen corresponding path program 1 times [2023-11-29 04:48:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:18,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966526685] [2023-11-29 04:48:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:48:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:48:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:48:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966526685] [2023-11-29 04:48:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966526685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942534454] [2023-11-29 04:48:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:19,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:19,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:19,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:48:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:19,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:48:19,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:48:19,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:48:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942534454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:48:19,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:48:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2023-11-29 04:48:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302675488] [2023-11-29 04:48:19,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:19,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:48:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:19,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:48:19,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:48:19,518 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:48:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:19,779 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2023-11-29 04:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:48:19,779 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2023-11-29 04:48:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:19,780 INFO L225 Difference]: With dead ends: 73 [2023-11-29 04:48:19,780 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 04:48:19,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:48:19,782 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:19,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 324 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:48:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 04:48:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2023-11-29 04:48:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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-29 04:48:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-11-29 04:48:19,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 30 [2023-11-29 04:48:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:19,792 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-29 04:48:19,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:48:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2023-11-29 04:48:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:48:19,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:19,793 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, 1, 1] [2023-11-29 04:48:19,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:48:19,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:19,994 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:19,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1022802718, now seen corresponding path program 1 times [2023-11-29 04:48:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154059208] [2023-11-29 04:48:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:21,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:48:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:22,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:48:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:48:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:48:22,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154059208] [2023-11-29 04:48:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154059208] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40174015] [2023-11-29 04:48:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:22,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:22,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:22,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:48:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:22,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-29 04:48:22,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:22,886 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-29 04:48:23,034 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|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 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-29 04:48:23,037 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|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 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-29 04:48:23,064 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-29 04:48:23,069 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)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2023-11-29 04:48:23,071 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)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2023-11-29 04:48:23,102 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:48:23,103 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 16 treesize of output 15 [2023-11-29 04:48:23,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 04:48:23,119 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2023-11-29 04:48:23,122 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2023-11-29 04:48:23,152 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2023-11-29 04:48:23,154 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2023-11-29 04:48:23,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,224 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-29 04:48:23,231 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 34 treesize of output 23 [2023-11-29 04:48:23,254 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))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))))) is different from false [2023-11-29 04:48:23,257 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))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))))) is different from true [2023-11-29 04:48:23,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2023-11-29 04:48:23,289 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 04:48:23,292 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 04:48:23,324 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 04:48:23,326 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 04:48:23,358 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-29 04:48:23,386 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 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|)))) is different from false [2023-11-29 04:48:23,389 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 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|)))) is different from true [2023-11-29 04:48:23,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 04:48:23,478 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) is different from false [2023-11-29 04:48:23,481 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) is different from true [2023-11-29 04:48:23,570 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from false [2023-11-29 04:48:23,574 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from true [2023-11-29 04:48:23,664 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 (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from false [2023-11-29 04:48:23,668 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 (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from true [2023-11-29 04:48:23,782 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 0 case distinctions, treesize of input 183 treesize of output 90 [2023-11-29 04:48:23,790 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-29 04:48:23,796 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 0 case distinctions, treesize of input 169 treesize of output 76 [2023-11-29 04:48:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,813 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 50 treesize of output 26 [2023-11-29 04:48:23,825 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-11-29 04:48:23,832 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 0 case distinctions, treesize of input 100 treesize of output 47 [2023-11-29 04:48:23,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,855 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-11-29 04:48:23,855 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 70 [2023-11-29 04:48:23,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:23,867 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 41 treesize of output 15 [2023-11-29 04:48:23,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2023-11-29 04:48:23,921 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))))))) is different from false [2023-11-29 04:48:23,925 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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))))))) is different from true [2023-11-29 04:48:23,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:23,961 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 83 treesize of output 59 [2023-11-29 04:48:24,073 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_30 Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from false [2023-11-29 04:48:24,076 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_30 Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from true [2023-11-29 04:48:24,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 04:48:24,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:24,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2023-11-29 04:48:24,223 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 7 treesize of output 3 [2023-11-29 04:48:24,298 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_31| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1)))) is different from false [2023-11-29 04:48:24,300 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_31| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1)))) is different from true [2023-11-29 04:48:24,327 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 15 treesize of output 7 [2023-11-29 04:48:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-29 04:48:24,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:24,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:24,434 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2023-11-29 04:48:24,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:24,446 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 320 treesize of output 323 [2023-11-29 04:48:24,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 146 [2023-11-29 04:48:24,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 282 [2023-11-29 04:48:24,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (let ((.cse8 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_49)))) (not .cse10))) (.cse9 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1))) (let ((.cse0 (and (or (and (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_48 Int)) (= (select (select (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse9) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse16 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse16 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse10) (or (and .cse8 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse18 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_49))))))) .cse9))) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse1)) (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse2)) (or (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse3 (select (store (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 (+ 8 v_arrayElimCell_49)))))) .cse8) .cse9) (or .cse10 (and (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse11 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse4))))) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) .cse4))) .cse9))) (or (not .cse9) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) is different from false [2023-11-29 04:48:25,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (let ((.cse12 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_49)))) (not .cse3))) (.cse4 (= .cse7 .cse1))) (let ((.cse0 (and (or .cse4 (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse16 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_49)))))) .cse12)) (or .cse3 (and (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse18 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_50)))))) (or .cse4 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_48 Int)) (= (select (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1)) (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse2)) (or .cse3 (and (or .cse4 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) .cse9)))) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse9))))))) (or .cse4 (and .cse12 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse9)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_49)))))))) (or (not .cse4) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_50)))))))))) is different from false [2023-11-29 04:48:25,741 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 (store .cse24 .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse6 (select .cse24 .cse11))) (let ((.cse0 (= .cse6 .cse8)) (.cse10 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) (+ 8 v_arrayElimCell_49)))) (not .cse13)))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse12 (and (or .cse13 (and (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_48)))))) (or .cse0 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) (+ 8 v_arrayElimCell_48))))))) (or .cse0 (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_48)))))) .cse10))))) (and (or .cse0 (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 (+ 8 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 .cse2))))) .cse10)) (or (= .cse11 .cse9) .cse12) (or .cse13 (and (or .cse0 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) .cse2)))) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse2))))))) (or (not .cse0) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) (+ 8 v_arrayElimCell_50))))) (or (= .cse5 .cse8) .cse12))))))) is different from false [2023-11-29 04:49:28,282 WARN L293 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 1091 DAG size of output: 904 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 04:49:28,283 INFO L349 Elim1Store]: treesize reduction 6617, result has 73.8 percent of original size [2023-11-29 04:49:28,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 191 case distinctions, treesize of input 130137 treesize of output 140378 [2023-11-29 04:49:30,102 INFO L224 Elim1Store]: Index analysis took 387 ms [2023-11-29 04:49:33,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:33,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 22503 treesize of output 31515 [2023-11-29 04:49:35,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:35,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20377 treesize of output 20354 [2023-11-29 04:49:37,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:37,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20141 treesize of output 20118 [2023-11-29 04:49:38,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20199 treesize of output 20187 [2023-11-29 04:49:40,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20153 treesize of output 20137 [2023-11-29 04:49:41,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:41,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20605 treesize of output 20574 [2023-11-29 04:49:43,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:43,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20225 treesize of output 20202 [2023-11-29 04:49:44,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20283 treesize of output 20271 [2023-11-29 04:49:46,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20237 treesize of output 20221 [2023-11-29 04:49:47,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:47,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20455 treesize of output 20438 [2023-11-29 04:49:49,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:49,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20259 treesize of output 20244 [2023-11-29 04:49:51,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20235 treesize of output 20229 [2023-11-29 04:49:52,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20229 treesize of output 20221 [2023-11-29 04:49:53,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:53,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20455 treesize of output 20438 [2023-11-29 04:49:55,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20493 treesize of output 20473 [2023-11-29 04:49:57,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:49:57,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20303 treesize of output 20288 [2023-11-29 04:49:58,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20369 treesize of output 20357 [2023-11-29 04:50:00,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20323 treesize of output 20307 [2023-11-29 04:50:02,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:02,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20487 treesize of output 20472 [2023-11-29 04:50:04,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:04,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20395 treesize of output 20372 [2023-11-29 04:50:06,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20453 treesize of output 20441 [2023-11-29 04:50:08,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20407 treesize of output 20391 [2023-11-29 04:50:09,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:09,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20571 treesize of output 20556 [2023-11-29 04:50:11,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:50:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20479 treesize of output 20456 [2023-11-29 04:50:13,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20681 treesize of output 20661 [2023-11-29 04:50:15,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20491 treesize of output 20475 [2023-11-29 04:50:16,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20475 treesize of output 20459 [2023-11-29 04:53:27,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 04:55:37,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 04:55:37,334 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 04:55:37,335 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 04:55:37,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:55:37,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:37,536 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 67 more [2023-11-29 04:55:37,539 INFO L158 Benchmark]: Toolchain (without parser) took 450124.45ms. Allocated memory was 153.1MB in the beginning and 578.8MB in the end (delta: 425.7MB). Free memory was 123.4MB in the beginning and 444.7MB in the end (delta: -321.4MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. [2023-11-29 04:55:37,539 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:55:37,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.48ms. Allocated memory is still 153.1MB. Free memory was 122.9MB in the beginning and 104.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:55:37,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 153.1MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:55:37,540 INFO L158 Benchmark]: Boogie Preprocessor took 52.25ms. Allocated memory is still 153.1MB. Free memory was 102.3MB in the beginning and 98.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:55:37,540 INFO L158 Benchmark]: RCFGBuilder took 487.77ms. Allocated memory is still 153.1MB. Free memory was 98.1MB in the beginning and 74.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:55:37,540 INFO L158 Benchmark]: TraceAbstraction took 449165.63ms. Allocated memory was 153.1MB in the beginning and 578.8MB in the end (delta: 425.7MB). Free memory was 74.2MB in the beginning and 444.7MB in the end (delta: -370.6MB). Peak memory consumption was 313.8MB. Max. memory is 16.1GB. [2023-11-29 04:55:37,542 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.48ms. Allocated memory is still 153.1MB. Free memory was 122.9MB in the beginning and 104.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 153.1MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.25ms. Allocated memory is still 153.1MB. Free memory was 102.3MB in the beginning and 98.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 487.77ms. Allocated memory is still 153.1MB. Free memory was 98.1MB in the beginning and 74.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 449165.63ms. Allocated memory was 153.1MB in the beginning and 578.8MB in the end (delta: 425.7MB). Free memory was 74.2MB in the beginning and 444.7MB in the end (delta: -370.6MB). Peak memory consumption was 313.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya --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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:55:39,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:55:39,322 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:55:39,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:55:39,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:55:39,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:55:39,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:55:39,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:55:39,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:55:39,366 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:55:39,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:55:39,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:55:39,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:55:39,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:55:39,369 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:55:39,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:55:39,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:55:39,371 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:55:39,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:55:39,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:55:39,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:55:39,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:55:39,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:55:39,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:55:39,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:55:39,376 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:55:39,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:55:39,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:55:39,377 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:55:39,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:55:39,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:55:39,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:55:39,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:55:39,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:55:39,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:55:39,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:55:39,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:55:39,380 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:55:39,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:55:39,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:55:39,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:55:39,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:55:39,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:55:39,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:55:39,382 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:55:39,382 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_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/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_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2023-11-29 04:55:39,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:55:39,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:55:39,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:55:39,692 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:55:39,692 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:55:39,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-29 04:55:42,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:55:42,697 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:55:42,697 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-29 04:55:42,712 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data/4d45bea1d/76c4778cf2ab4a26bfc3db7b2e89c0d4/FLAG528bda0d2 [2023-11-29 04:55:42,725 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/data/4d45bea1d/76c4778cf2ab4a26bfc3db7b2e89c0d4 [2023-11-29 04:55:42,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:55:42,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:55:42,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:55:42,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:55:42,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:55:42,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:55:42" (1/1) ... [2023-11-29 04:55:42,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d21fe02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:42, skipping insertion in model container [2023-11-29 04:55:42,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:55:42" (1/1) ... [2023-11-29 04:55:42,779 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:55:43,039 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_bd59078e-8afb-4d01-93e2-a1e52158da8b/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-11-29 04:55:43,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:55:43,055 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:55:43,101 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_bd59078e-8afb-4d01-93e2-a1e52158da8b/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-11-29 04:55:43,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:55:43,134 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:55:43,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43 WrapperNode [2023-11-29 04:55:43,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:55:43,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:55:43,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:55:43,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:55:43,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,185 INFO L138 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 188 [2023-11-29 04:55:43,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:55:43,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:55:43,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:55:43,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:55:43,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,222 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2023-11-29 04:55:43,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:55:43,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:55:43,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:55:43,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:55:43,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:55:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:43,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:55:43,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:55:43,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:55:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:55:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:55:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 04:55:43,318 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 04:55:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:55:43,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:55:43,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:55:43,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:55:43,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:55:43,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:55:43,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:55:43,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:55:43,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:55:43,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:55:43,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:55:43,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:55:43,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:55:43,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:55:43,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:55:43,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:55:43,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:55:43,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:55:43,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:55:43,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:55:43,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:55:43,500 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:55:43,503 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:55:44,599 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:55:44,640 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:55:44,640 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 04:55:44,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:44 BoogieIcfgContainer [2023-11-29 04:55:44,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:55:44,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:55:44,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:55:44,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:55:44,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:55:42" (1/3) ... [2023-11-29 04:55:44,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df97592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:55:44, skipping insertion in model container [2023-11-29 04:55:44,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (2/3) ... [2023-11-29 04:55:44,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df97592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:55:44, skipping insertion in model container [2023-11-29 04:55:44,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:44" (3/3) ... [2023-11-29 04:55:44,650 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-11-29 04:55:44,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:55:44,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:55:44,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:55:44,710 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;@bc8984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:55:44,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:55:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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-29 04:55:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:55:44,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:44,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:44,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:44,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2023-11-29 04:55:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844844308] [2023-11-29 04:55:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:44,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:44,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:44,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:44,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:55:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:44,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:55:45,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:45,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:45,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844844308] [2023-11-29 04:55:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844844308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:55:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197450318] [2023-11-29 04:55:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:45,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:55:45,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:55:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:55:45,067 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:55:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:45,216 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2023-11-29 04:55:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:55:45,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-29 04:55:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:45,226 INFO L225 Difference]: With dead ends: 66 [2023-11-29 04:55:45,226 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 04:55:45,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:55:45,233 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:45,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:55:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 04:55:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 04:55:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-29 04:55:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-29 04:55:45,275 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2023-11-29 04:55:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:45,276 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-29 04:55:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:55:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-29 04:55:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:55:45,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:45,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:45,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:55:45,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:45,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:45,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2023-11-29 04:55:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123679579] [2023-11-29 04:55:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:45,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:45,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:45,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:45,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:55:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:45,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:55:45,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:45,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:45,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123679579] [2023-11-29 04:55:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123679579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:55:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165636152] [2023-11-29 04:55:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:45,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:45,725 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:55:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:45,902 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-29 04:55:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-29 04:55:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:45,904 INFO L225 Difference]: With dead ends: 57 [2023-11-29 04:55:45,904 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 04:55:45,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-29 04:55:45,909 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:45,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:55:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 04:55:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-29 04:55:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-29 04:55:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2023-11-29 04:55:45,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19 [2023-11-29 04:55:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:45,918 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2023-11-29 04:55:45,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:55:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2023-11-29 04:55:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:55:45,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:45,920 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] [2023-11-29 04:55:45,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:55:46,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:46,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:46,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash -174060619, now seen corresponding path program 1 times [2023-11-29 04:55:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:46,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656848716] [2023-11-29 04:55:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:46,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:46,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:46,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:46,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:55:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:55:46,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:55:46,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:46,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656848716] [2023-11-29 04:55:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656848716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:46,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:46,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091687519] [2023-11-29 04:55:46,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:46,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:55:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:55:46,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:55:46,424 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:55:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:46,610 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2023-11-29 04:55:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:55:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 04:55:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:46,612 INFO L225 Difference]: With dead ends: 47 [2023-11-29 04:55:46,612 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 04:55:46,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:46,614 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:46,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:55:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 04:55:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 04:55:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 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-29 04:55:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-11-29 04:55:46,623 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 27 [2023-11-29 04:55:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:46,623 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-11-29 04:55:46,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:55:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-11-29 04:55:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:55:46,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:46,625 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] [2023-11-29 04:55:46,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:55:46,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:46,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:46,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2023-11-29 04:55:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914591664] [2023-11-29 04:55:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:46,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:46,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:46,829 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:46,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:55:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:47,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-29 04:55:47,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:47,211 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 7 [2023-11-29 04:55:47,426 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-29 04:55:47,541 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:55:47,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:55:47,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:55:47,686 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-29 04:55:47,824 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-29 04:55:47,836 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-29 04:55:48,211 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-29 04:55:48,212 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 185 treesize of output 165 [2023-11-29 04:55:48,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:55:48,233 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 44 treesize of output 33 [2023-11-29 04:55:48,242 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-29 04:55:48,269 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 112 treesize of output 85 [2023-11-29 04:55:48,493 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:55:48,494 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 57 [2023-11-29 04:55:48,506 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 21 treesize of output 11 [2023-11-29 04:55:48,514 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-29 04:55:48,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 04:55:48,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:55:48,855 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 04:55:48,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 71 [2023-11-29 04:55:48,897 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 04:55:48,897 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 32 treesize of output 34 [2023-11-29 04:55:48,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:55:49,375 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 40 treesize of output 16 [2023-11-29 04:55:49,650 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 39 treesize of output 15 [2023-11-29 04:55:49,662 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 25 treesize of output 15 [2023-11-29 04:55:49,781 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-29 04:55:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:49,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:50,361 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_349 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_349) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_347) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_346) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (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-29 04:55:50,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_356) .cse0) .cse1 (select v_ArrVal_349 .cse1)) v_ArrVal_349)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_349) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_347) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_357) .cse0) .cse1) v_ArrVal_346) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12|)))))) is different from false [2023-11-29 04:55:50,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914591664] [2023-11-29 04:55:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914591664] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [276998922] [2023-11-29 04:55:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:55:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:55:50,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:55:50,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-29 04:55:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-29 04:55:51,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:51,461 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 7 [2023-11-29 04:55:51,694 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-29 04:55:51,749 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:55:51,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:55:51,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:55:51,914 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-29 04:55:52,098 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-29 04:55:52,121 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-29 04:55:52,532 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-29 04:55:52,533 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 185 treesize of output 165 [2023-11-29 04:55:52,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:55:52,548 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 44 treesize of output 33 [2023-11-29 04:55:52,555 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 100 treesize of output 77 [2023-11-29 04:55:52,574 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-29 04:55:52,582 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-29 04:55:52,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 04:55:52,769 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-29 04:55:52,777 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 19 treesize of output 11 [2023-11-29 04:55:57,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:55:57,208 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 40 treesize of output 29 [2023-11-29 04:55:57,242 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 04:55:57,242 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 32 treesize of output 34 [2023-11-29 04:55:57,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:55:57,764 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 40 treesize of output 16 [2023-11-29 04:55:58,032 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 39 treesize of output 15 [2023-11-29 04:55:58,042 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 25 treesize of output 15 [2023-11-29 04:55:58,190 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-29 04:55:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:58,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:58,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_482 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_349) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_347) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_481) .cse0) .cse1) v_ArrVal_346) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_349 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_482) .cse0) .cse1 (select v_ArrVal_349 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16|) (_ bv0 1)))))) is different from false [2023-11-29 04:55:58,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [276998922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:58,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:55:58,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2023-11-29 04:55:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821089760] [2023-11-29 04:55:58,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:58,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 04:55:58,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:58,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 04:55:58,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1741, Unknown=17, NotChecked=258, Total=2162 [2023-11-29 04:55:58,541 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 29 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:56:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:56:13,840 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2023-11-29 04:56:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:56:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 29 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-11-29 04:56:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:56:13,843 INFO L225 Difference]: With dead ends: 69 [2023-11-29 04:56:13,843 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 04:56:13,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=241, Invalid=2827, Unknown=24, NotChecked=330, Total=3422 [2023-11-29 04:56:13,845 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 92 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 24 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:56:13,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 277 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 645 Invalid, 12 Unknown, 0 Unchecked, 14.0s Time] [2023-11-29 04:56:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 04:56:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2023-11-29 04:56:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:56:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2023-11-29 04:56:13,860 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 28 [2023-11-29 04:56:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:56:13,861 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2023-11-29 04:56:13,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 29 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:56:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2023-11-29 04:56:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:56:13,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:13,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:56:13,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-11-29 04:56:14,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:56:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:14,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:56:14,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958037, now seen corresponding path program 2 times [2023-11-29 04:56:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:56:14,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480195681] [2023-11-29 04:56:14,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:56:14,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:14,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:56:14,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:56:14,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:56:14,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:56:14,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:56:14,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:56:14,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:56:14,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:56:15,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:56:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480195681] [2023-11-29 04:56:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480195681] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:56:15,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:56:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:56:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304333649] [2023-11-29 04:56:15,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:56:15,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:56:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:56:15,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:56:15,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:56:15,141 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 04:56:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:56:15,443 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2023-11-29 04:56:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:56:15,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-11-29 04:56:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:56:15,445 INFO L225 Difference]: With dead ends: 65 [2023-11-29 04:56:15,445 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 04:56:15,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:56:15,446 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:56:15,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:56:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 04:56:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 04:56:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:56:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-11-29 04:56:15,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2023-11-29 04:56:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:56:15,454 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-11-29 04:56:15,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 04:56:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2023-11-29 04:56:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:56:15,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:15,456 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, 1] [2023-11-29 04:56:15,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:56:15,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:15,656 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:56:15,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1486153936, now seen corresponding path program 1 times [2023-11-29 04:56:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:56:15,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358776219] [2023-11-29 04:56:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:15,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:56:15,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:56:15,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:56:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:15,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:56:15,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:15,967 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-29 04:56:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:56:15,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:56:16,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:56:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358776219] [2023-11-29 04:56:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358776219] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:56:16,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:56:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2023-11-29 04:56:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624405632] [2023-11-29 04:56:16,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:56:16,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:56:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:56:16,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:56:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:56:16,052 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 04:56:20,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:24,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:29,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:56:29,666 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2023-11-29 04:56:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:56:29,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-29 04:56:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:56:29,668 INFO L225 Difference]: With dead ends: 78 [2023-11-29 04:56:29,668 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 04:56:29,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:56:29,669 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:56:29,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 239 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2023-11-29 04:56:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 04:56:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 04:56:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 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-29 04:56:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-11-29 04:56:29,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 30 [2023-11-29 04:56:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:56:29,678 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-11-29 04:56:29,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 04:56:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-11-29 04:56:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:56:29,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:29,679 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, 1, 1] [2023-11-29 04:56:29,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:56:29,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:29,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:56:29,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1022802718, now seen corresponding path program 1 times [2023-11-29 04:56:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:56:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43452398] [2023-11-29 04:56:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:29,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:29,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:56:29,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:56:29,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd59078e-8afb-4d01-93e2-a1e52158da8b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:56:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:30,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 04:56:30,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:30,224 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 7 [2023-11-29 04:56:30,350 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:56:30,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:56:30,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:56:30,461 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-29 04:56:30,650 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-29 04:56:30,650 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 136 treesize of output 128 [2023-11-29 04:56:30,662 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 61 treesize of output 22 [2023-11-29 04:56:30,668 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 40 treesize of output 27 [2023-11-29 04:56:30,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 04:56:30,759 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 19 treesize of output 11 [2023-11-29 04:56:30,874 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-29 04:56:30,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:30,974 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 40 treesize of output 29 [2023-11-29 04:56:31,011 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 04:56:31,012 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 32 treesize of output 34 [2023-11-29 04:56:31,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:31,662 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 71 treesize of output 25 [2023-11-29 04:56:31,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-11-29 04:56:31,681 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 50 [2023-11-29 04:56:31,715 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-11-29 04:56:31,715 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 73 [2023-11-29 04:56:31,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2023-11-29 04:56:31,735 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 41 treesize of output 15 [2023-11-29 04:56:31,846 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 50 treesize of output 30 [2023-11-29 04:56:31,959 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 27 treesize of output 15 [2023-11-29 04:56:31,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:56:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:32,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:32,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:32,449 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 71 [2023-11-29 04:56:32,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:32,520 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 268 treesize of output 271 [2023-11-29 04:56:32,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 236 [2023-11-29 04:56:32,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 114 [2023-11-29 04:56:40,076 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse9 (not .cse6)) (.cse8 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (and (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= (select .cse22 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_791 (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (bvadd (_ bv8 32) v_arrayElimCell_74)))))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= (select .cse25 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (bvadd (_ bv8 32) v_arrayElimCell_76)))))))))) (or .cse8 (and (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) (bvadd (_ bv8 32) v_arrayElimCell_74))))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse27 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (not (= v_ArrVal_791 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse29 (select (store (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (bvadd (_ bv8 32) v_arrayElimCell_76))) (not (= v_ArrVal_791 (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (bvadd (_ bv8 32) v_arrayElimCell_74))))))) .cse6))) (.cse11 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= (select .cse2 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 (bvadd (_ bv8 32) v_arrayElimCell_76)))))))))) (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) (bvadd (_ bv8 32) v_arrayElimCell_76))) (not (= v_ArrVal_791 (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (not .cse8)) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse10 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse11)) (= (select .cse10 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_791 (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse11)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (bvadd (_ bv8 32) v_arrayElimCell_76))) (not (= v_ArrVal_791 (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) .cse15) (or .cse15 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse11)) (= (select .cse16 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (bvadd (_ bv8 32) v_arrayElimCell_76))))))) (not (= v_ArrVal_791 (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse8 (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse11)) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse18 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (not (= v_ArrVal_791 (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) .cse11)) (not (= v_ArrVal_791 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_791 (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))))))) is different from false [2023-11-29 04:56:44,105 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse9 (not .cse6)) (.cse8 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (and (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= (select .cse22 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_791 (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (bvadd (_ bv8 32) v_arrayElimCell_74)))))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= (select .cse25 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (bvadd (_ bv8 32) v_arrayElimCell_76)))))))))) (or .cse8 (and (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) (bvadd (_ bv8 32) v_arrayElimCell_74))))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse27 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (not (= v_ArrVal_791 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse29 (select (store (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (bvadd (_ bv8 32) v_arrayElimCell_76))) (not (= v_ArrVal_791 (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (bvadd (_ bv8 32) v_arrayElimCell_74))))))) .cse6))) (.cse11 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= (select .cse2 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 (bvadd (_ bv8 32) v_arrayElimCell_76)))))))))) (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) (bvadd (_ bv8 32) v_arrayElimCell_76))) (not (= v_ArrVal_791 (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (not .cse8)) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse10 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse11)) (= (select .cse10 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_791 (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse11)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (bvadd (_ bv8 32) v_arrayElimCell_76))) (not (= v_ArrVal_791 (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) .cse15) (or .cse15 (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse11)) (= (select .cse16 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (bvadd (_ bv8 32) v_arrayElimCell_76))))))) (not (= v_ArrVal_791 (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse8 (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse11)) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse18 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (not (= v_ArrVal_791 (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse6 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) .cse11)) (not (= v_ArrVal_791 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_793) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_794) .cse4) .cse5)) (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_791 (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))))))) is different from true [2023-11-29 04:56:50,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse7 (= .cse5 .cse3))) (let ((.cse9 (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse10 (not .cse7)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse17 (and (or .cse9 (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (bvadd (_ bv8 32) v_arrayElimCell_75))))))) (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)) (bvadd (_ bv8 32) v_arrayElimCell_74))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))) .cse7))) (or .cse7 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (let ((.cse26 (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (bvadd (_ bv8 32) v_arrayElimCell_74))) (= (select .cse26 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))))) (or .cse10 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_74))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_75))) (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select (store (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (bvadd (_ bv8 32) v_arrayElimCell_74))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (bvadd (_ bv8 32) v_arrayElimCell_75))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse31 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|))))))))))) (and (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 (bvadd (_ bv8 32) v_arrayElimCell_75))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse2 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or .cse7 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)) (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))))) (not .cse9)) (or .cse10 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)) (bvadd (_ bv8 32) v_arrayElimCell_75))) (not (= (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791)))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= (select .cse13 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (bvadd (_ bv8 32) v_arrayElimCell_75))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse13 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or .cse7 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= (select .cse15 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse15 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse17) (or .cse9 (and (or .cse7 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)) .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791)))))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= (select .cse20 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (bvadd (_ bv8 32) v_arrayElimCell_75)))))))))))) (or .cse10 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_788))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_791) .cse3 v_ArrVal_793) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_790) .cse3 v_ArrVal_794) .cse5) .cse6)))) (or (= (select .cse21 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (bvadd (_ bv8 32) v_arrayElimCell_75))) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_791 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_791))))))) (or .cse17 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))))) is different from false [2023-11-29 04:56:52,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse34 .cse18))) (let ((.cse9 (= .cse6 .cse4))) (let ((.cse11 (not .cse9)) (.cse0 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse34 .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (and (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse26 (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse26 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (bvadd (_ bv8 32) v_arrayElimCell_74))))))) .cse11) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (= (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse30 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (bvadd (_ bv8 32) v_arrayElimCell_74))))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) (bvadd (_ bv8 32) v_arrayElimCell_74)))))))) .cse0) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse33 (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse33 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (bvadd (_ bv8 32) v_arrayElimCell_74)))))))))) (.cse14 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv8 32)))) (and (or (not .cse0) (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (= (select .cse3 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse3 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse13 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse13 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse16 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse16 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or (= .cse6 .cse8) .cse17) (or (= .cse7 .cse18) .cse17) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse11) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (= (select .cse21 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse21 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse21 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse23 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse23 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) .cse14) |c_ULTIMATE.start_main_~uneq~0#1|)))))) .cse0)))))))) is different from false [2023-11-29 04:56:56,917 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse34 .cse18))) (let ((.cse9 (= .cse6 .cse4))) (let ((.cse11 (not .cse9)) (.cse0 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse34 .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (and (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse26 (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse26 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (bvadd (_ bv8 32) v_arrayElimCell_74))))))) .cse11) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (= (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_74))) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse28 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse30 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (bvadd (_ bv8 32) v_arrayElimCell_74))))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) (bvadd (_ bv8 32) v_arrayElimCell_74)))))))) .cse0) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse33 (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse33 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (bvadd (_ bv8 32) v_arrayElimCell_74)))))))))) (.cse14 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv8 32)))) (and (or (not .cse0) (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (= (select .cse3 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse3 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse13 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse13 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (not (= v_ArrVal_791 (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select .cse16 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse16 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or (= .cse6 .cse8) .cse17) (or (= .cse7 .cse18) .cse17) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse11) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (= (select .cse21 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse21 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_76 (_ BitVec 32))) (= (select .cse21 (bvadd (_ bv8 32) v_arrayElimCell_76)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (or (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= (select .cse23 (bvadd (_ bv8 32) v_arrayElimCell_75)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse23 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or .cse9 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| .cse8 v_ArrVal_788))) (or (not (= v_ArrVal_791 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_791 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_791 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_791) .cse4 v_ArrVal_793) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_790) .cse4 v_ArrVal_794) .cse6) .cse7)) .cse14) |c_ULTIMATE.start_main_~uneq~0#1|)))))) .cse0)))))))) is different from true