./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:07:58,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:07:58,962 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:07:58,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:07:58,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:07:58,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:07:58,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:07:58,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:07:58,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:07:58,995 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:07:58,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:07:58,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:07:58,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:07:58,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:07:58,997 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:07:58,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:07:58,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:07:58,999 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:07:58,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:07:59,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:07:59,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:07:59,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:07:59,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:07:59,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:07:59,002 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:07:59,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:07:59,003 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:07:59,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:07:59,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:07:59,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:07:59,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:07:59,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:07:59,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:07:59,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:07:59,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:07:59,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:07:59,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:07:59,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:07:59,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:07:59,008 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:07:59,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:07:59,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:07:59,010 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_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2023-11-29 03:07:59,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:07:59,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:07:59,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:07:59,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:07:59,234 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:07:59,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-29 03:08:01,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:08:02,229 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:08:02,229 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-29 03:08:02,242 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data/c6b3ea05d/3d832b29e874411fa07960f4b5695954/FLAG5364d03fd [2023-11-29 03:08:02,254 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data/c6b3ea05d/3d832b29e874411fa07960f4b5695954 [2023-11-29 03:08:02,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:08:02,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:08:02,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:08:02,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:08:02,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:08:02,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26db0847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02, skipping insertion in model container [2023-11-29 03:08:02,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:08:02,569 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_a10d55bc-85d4-42c1-92ff-295784438d43/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-29 03:08:02,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:08:02,582 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:08:02,625 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_a10d55bc-85d4-42c1-92ff-295784438d43/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-29 03:08:02,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:08:02,651 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:08:02,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02 WrapperNode [2023-11-29 03:08:02,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:08:02,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:08:02,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:08:02,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:08:02,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,697 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-11-29 03:08:02,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:08:02,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:08:02,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:08:02,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:08:02,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,737 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 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 03:08:02,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:08:02,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:08:02,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:08:02,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:08:02,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (1/1) ... [2023-11-29 03:08:02,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:08:02,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:08:02,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:08:02,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:08:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:08:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:08:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:08:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:08:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:08:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:08:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 03:08:02,829 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 03:08:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:08:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:08:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:08:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:08:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:08:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:08:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:08:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:08:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:08:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:08:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:08:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:08:02,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:08:02,949 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:08:02,950 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:08:03,192 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:08:03,225 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:08:03,225 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 03:08:03,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:03 BoogieIcfgContainer [2023-11-29 03:08:03,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:08:03,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:08:03,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:08:03,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:08:03,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:08:02" (1/3) ... [2023-11-29 03:08:03,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9b2c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:08:03, skipping insertion in model container [2023-11-29 03:08:03,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:02" (2/3) ... [2023-11-29 03:08:03,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9b2c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:08:03, skipping insertion in model container [2023-11-29 03:08:03,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:03" (3/3) ... [2023-11-29 03:08:03,234 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-11-29 03:08:03,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:08:03,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:08:03,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:08:03,301 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;@67e6aee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:08:03,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:08:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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 03:08:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:08:03,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:03,314 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 03:08:03,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:03,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -680816188, now seen corresponding path program 1 times [2023-11-29 03:08:03,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792681589] [2023-11-29 03:08:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:08:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:03,627 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 03:08:03,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:03,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792681589] [2023-11-29 03:08:03,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792681589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:03,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:03,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:08:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262346882] [2023-11-29 03:08:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:03,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:08:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:08:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:08:03,669 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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 03:08:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:03,763 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2023-11-29 03:08:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:08:03,766 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 03:08:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:03,772 INFO L225 Difference]: With dead ends: 56 [2023-11-29 03:08:03,773 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 03:08:03,775 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 03:08:03,779 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:03,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:08:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 03:08:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 03:08:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 03:08:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-29 03:08:03,816 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 19 [2023-11-29 03:08:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:03,818 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-29 03:08:03,818 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 03:08:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-29 03:08:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:08:03,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:03,820 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 03:08:03,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:08:03,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:03,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558312, now seen corresponding path program 1 times [2023-11-29 03:08:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184621524] [2023-11-29 03:08:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:08:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:04,004 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 03:08:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184621524] [2023-11-29 03:08:04,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184621524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:04,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:08:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697576506] [2023-11-29 03:08:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:04,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:08:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:08:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:08:04,009 INFO L87 Difference]: Start difference. First operand 25 states and 33 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 03:08:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:04,098 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-29 03:08:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:08:04,099 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 03:08:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:04,100 INFO L225 Difference]: With dead ends: 35 [2023-11-29 03:08:04,100 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 03:08:04,101 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 03:08:04,102 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 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 03:08:04,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:08:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 03:08:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-11-29 03:08:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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 03:08:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-29 03:08:04,110 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2023-11-29 03:08:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:04,111 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-29 03:08:04,111 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 03:08:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-29 03:08:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:08:04,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:04,112 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 03:08:04,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:08:04,113 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:04,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash -112877035, now seen corresponding path program 1 times [2023-11-29 03:08:04,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:04,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883854861] [2023-11-29 03:08:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:04,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:08:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:04,299 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 03:08:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883854861] [2023-11-29 03:08:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883854861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:04,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:08:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782609274] [2023-11-29 03:08:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:04,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:08:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:08:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:08:04,302 INFO L87 Difference]: Start difference. First operand 27 states and 36 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 03:08:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:04,371 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2023-11-29 03:08:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:08:04,372 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 03:08:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:04,372 INFO L225 Difference]: With dead ends: 47 [2023-11-29 03:08:04,372 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 03:08:04,373 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 03:08:04,374 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:04,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:08:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 03:08:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 03:08:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 03:08:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-11-29 03:08:04,381 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2023-11-29 03:08:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:04,381 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-11-29 03:08:04,381 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 03:08:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-11-29 03:08:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:08:04,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:04,383 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 03:08:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:08:04,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:04,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 935091600, now seen corresponding path program 1 times [2023-11-29 03:08:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772063679] [2023-11-29 03:08:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:08:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:07,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:08:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:07,313 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 03:08:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:07,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772063679] [2023-11-29 03:08:07,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772063679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:08:07,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679921538] [2023-11-29 03:08:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:08:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:08:07,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:08:07,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:08:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:07,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 03:08:07,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:08:08,023 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 03:08:08,244 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 03:08:08,341 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:08:08,342 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 03:08:08,432 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 03:08:08,441 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 03:08:08,548 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:08:08,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-11-29 03:08:08,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:08:08,789 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-29 03:08:08,790 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 151 [2023-11-29 03:08:08,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:08:08,802 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 03:08:08,817 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 86 [2023-11-29 03:08:08,847 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 03:08:09,027 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:08:09,027 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 170 treesize of output 95 [2023-11-29 03:08:09,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 03:08:09,045 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 03:08:09,051 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 03:08:09,338 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:08:09,339 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 03:08:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:08:09,378 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 03:08:09,378 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 178 treesize of output 109 [2023-11-29 03:08:09,408 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 03:08:09,408 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 03:08:09,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 19 [2023-11-29 03:08:09,877 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-11-29 03:08:09,887 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 03:08:09,978 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 03:08:10,080 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 03:08:10,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:08:27,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679921538] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:08:27,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:08:27,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-11-29 03:08:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184600371] [2023-11-29 03:08:27,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:08:27,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 03:08:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:27,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 03:08:27,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2160, Unknown=32, NotChecked=0, Total=2352 [2023-11-29 03:08:27,326 INFO L87 Difference]: Start difference. First operand 28 states and 37 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 03:08:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:30,564 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2023-11-29 03:08:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 03:08:30,565 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 03:08:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:30,566 INFO L225 Difference]: With dead ends: 69 [2023-11-29 03:08:30,566 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 03:08:30,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=364, Invalid=4574, Unknown=32, NotChecked=0, Total=4970 [2023-11-29 03:08:30,570 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:30,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 354 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1136 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 03:08:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 03:08:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 36. [2023-11-29 03:08:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 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 03:08:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2023-11-29 03:08:30,581 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 28 [2023-11-29 03:08:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:30,582 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-11-29 03:08:30,582 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 03:08:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2023-11-29 03:08:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:08:30,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:30,584 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 03:08:30,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:08:30,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:08:30,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:30,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 158692931, now seen corresponding path program 1 times [2023-11-29 03:08:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559465377] [2023-11-29 03:08:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:08:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:08:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:30,924 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 03:08:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559465377] [2023-11-29 03:08:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559465377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:30,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:30,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:08:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348933980] [2023-11-29 03:08:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:30,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:08:30,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:30,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:08:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:08:30,926 INFO L87 Difference]: Start difference. First operand 36 states and 46 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 03:08:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:31,001 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2023-11-29 03:08:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:08:31,002 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 03:08:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:31,003 INFO L225 Difference]: With dead ends: 45 [2023-11-29 03:08:31,003 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 03:08:31,003 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 03:08:31,004 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:31,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:08:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 03:08:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 03:08:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 03:08:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-11-29 03:08:31,014 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 29 [2023-11-29 03:08:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:31,014 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-11-29 03:08:31,014 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 03:08:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-11-29 03:08:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:08:31,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:31,015 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 03:08:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:08:31,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:31,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 458760797, now seen corresponding path program 2 times [2023-11-29 03:08:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233949433] [2023-11-29 03:08:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:08:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:08:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:31,209 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 03:08:31,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233949433] [2023-11-29 03:08:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233949433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:31,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:31,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:08:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507293615] [2023-11-29 03:08:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:31,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:08:31,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:08:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:08:31,212 INFO L87 Difference]: Start difference. First operand 35 states and 44 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 03:08:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:31,310 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-11-29 03:08:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:08:31,311 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 03:08:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:31,311 INFO L225 Difference]: With dead ends: 44 [2023-11-29 03:08:31,312 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 03:08:31,312 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 03:08:31,313 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:31,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 62 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:08:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 03:08:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 03:08:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 03:08:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 03:08:31,321 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 29 [2023-11-29 03:08:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:31,321 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 03:08:31,321 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 03:08:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 03:08:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:08:31,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:31,322 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 03:08:31,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:08:31,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:31,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 976741128, now seen corresponding path program 1 times [2023-11-29 03:08:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084011451] [2023-11-29 03:08:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:08:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:08:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:08:32,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084011451] [2023-11-29 03:08:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084011451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:08:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796552765] [2023-11-29 03:08:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:32,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:08:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:08:32,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:08:32,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:08:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:32,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 03:08:32,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:08:32,603 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 03:08:32,758 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:08:32,758 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 03:08:32,802 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 03:08:32,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:08:32,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 03:08:32,969 INFO L349 Elim1Store]: treesize reduction 74, result has 12.9 percent of original size [2023-11-29 03:08:32,969 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 178 treesize of output 162 [2023-11-29 03:08:32,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 94 [2023-11-29 03:08:32,988 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 121 treesize of output 56 [2023-11-29 03:08:33,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:08:33,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 17 [2023-11-29 03:08:33,050 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 03:08:33,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:08:33,156 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 75 treesize of output 52 [2023-11-29 03:08:33,174 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-29 03:08:33,174 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 03:08:33,679 INFO L349 Elim1Store]: treesize reduction 827, result has 22.3 percent of original size [2023-11-29 03:08:33,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 447 treesize of output 300 [2023-11-29 03:08:58,206 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 1324 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:08:58,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:08:58,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 2831 treesize of output 4763 [2023-11-29 03:19:32,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 03:19:32,246 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:32,247 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 03:19:32,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:19:32,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:19:32,448 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_a10d55bc-85d4-42c1-92ff-295784438d43/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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:500) 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:140) 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$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$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$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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) 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) ... 86 more [2023-11-29 03:19:32,451 INFO L158 Benchmark]: Toolchain (without parser) took 690192.79ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 116.9MB in the beginning and 259.1MB in the end (delta: -142.2MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. [2023-11-29 03:19:32,451 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:19:32,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.01ms. Allocated memory is still 172.0MB. Free memory was 116.6MB in the beginning and 98.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:19:32,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.99ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 96.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:19:32,451 INFO L158 Benchmark]: Boogie Preprocessor took 63.33ms. Allocated memory is still 172.0MB. Free memory was 96.0MB in the beginning and 92.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:19:32,452 INFO L158 Benchmark]: RCFGBuilder took 463.12ms. Allocated memory is still 172.0MB. Free memory was 92.4MB in the beginning and 134.8MB in the end (delta: -42.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 03:19:32,452 INFO L158 Benchmark]: TraceAbstraction took 689222.22ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 134.1MB in the beginning and 259.1MB in the end (delta: -125.0MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. [2023-11-29 03:19:32,453 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.19ms. Allocated memory is still 107.0MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.01ms. Allocated memory is still 172.0MB. Free memory was 116.6MB in the beginning and 98.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.99ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 96.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.33ms. Allocated memory is still 172.0MB. Free memory was 96.0MB in the beginning and 92.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 463.12ms. Allocated memory is still 172.0MB. Free memory was 92.4MB in the beginning and 134.8MB in the end (delta: -42.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 689222.22ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 134.1MB in the beginning and 259.1MB in the end (delta: -125.0MB). Peak memory consumption was 221.0MB. 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_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:19:34,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:19:34,249 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:19:34,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:19:34,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:19:34,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:19:34,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:19:34,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:19:34,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:19:34,296 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:19:34,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:19:34,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:19:34,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:19:34,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:19:34,300 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:19:34,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:19:34,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:19:34,301 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:19:34,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:19:34,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:19:34,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:19:34,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:19:34,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:19:34,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:19:34,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:19:34,305 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:19:34,305 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:19:34,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:19:34,306 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:19:34,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:19:34,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:19:34,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:19:34,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:19:34,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:19:34,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:19:34,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:19:34,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:19:34,309 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:19:34,310 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:19:34,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:19:34,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:19:34,310 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:19:34,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:19:34,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:19:34,311 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:19:34,311 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_a10d55bc-85d4-42c1-92ff-295784438d43/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_a10d55bc-85d4-42c1-92ff-295784438d43/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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2023-11-29 03:19:34,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:19:34,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:19:34,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:19:34,611 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:19:34,611 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:19:34,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-29 03:19:37,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:19:37,592 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:19:37,593 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-29 03:19:37,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data/576baf87c/c4a9510927aa4ee9913702c2762d6add/FLAGa12b1253b [2023-11-29 03:19:37,622 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/data/576baf87c/c4a9510927aa4ee9913702c2762d6add [2023-11-29 03:19:37,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:19:37,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:19:37,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:19:37,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:19:37,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:19:37,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:19:37" (1/1) ... [2023-11-29 03:19:37,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290ea05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:37, skipping insertion in model container [2023-11-29 03:19:37,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:19:37" (1/1) ... [2023-11-29 03:19:37,680 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:19:37,970 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_a10d55bc-85d4-42c1-92ff-295784438d43/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-29 03:19:37,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:19:37,988 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:19:38,032 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_a10d55bc-85d4-42c1-92ff-295784438d43/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-29 03:19:38,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:19:38,066 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:19:38,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38 WrapperNode [2023-11-29 03:19:38,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:19:38,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:19:38,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:19:38,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:19:38,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,142 INFO L138 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 157 [2023-11-29 03:19:38,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:19:38,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:19:38,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:19:38,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:19:38,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,196 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 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 03:19:38,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:19:38,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:19:38,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:19:38,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:19:38,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (1/1) ... [2023-11-29 03:19:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:19:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:19:38,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:19:38,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:19:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:19:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:19:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:19:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 03:19:38,286 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 03:19:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:19:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:19:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:19:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:19:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:19:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:19:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:19:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:19:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:19:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:19:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:19:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:19:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:19:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:19:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:19:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:19:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:19:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:19:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:19:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:19:38,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:19:38,440 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:19:38,443 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:19:39,212 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:19:39,248 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:19:39,248 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 03:19:39,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:19:39 BoogieIcfgContainer [2023-11-29 03:19:39,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:19:39,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:19:39,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:19:39,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:19:39,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:19:37" (1/3) ... [2023-11-29 03:19:39,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f2bdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:19:39, skipping insertion in model container [2023-11-29 03:19:39,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:19:38" (2/3) ... [2023-11-29 03:19:39,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f2bdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:19:39, skipping insertion in model container [2023-11-29 03:19:39,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:19:39" (3/3) ... [2023-11-29 03:19:39,256 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-11-29 03:19:39,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:19:39,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:19:39,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:19:39,318 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;@73a4f8b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:19:39,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:19:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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 03:19:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:19:39,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:39,329 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 03:19:39,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:19:39,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash -680816188, now seen corresponding path program 1 times [2023-11-29 03:19:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:19:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978401194] [2023-11-29 03:19:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:39,346 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 03:19:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:19:39,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:39,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:39,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:19:39,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:39,617 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 03:19:39,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:19:39,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:19:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978401194] [2023-11-29 03:19:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978401194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:19:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955278297] [2023-11-29 03:19:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:39,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:19:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:19:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:19:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:19:39,650 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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 6.5) internal successors, (13), 2 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 03:19:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:39,774 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2023-11-29 03:19:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:19:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 03:19:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:39,781 INFO L225 Difference]: With dead ends: 56 [2023-11-29 03:19:39,781 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 03:19:39,783 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 03:19:39,786 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:39,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:19:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 03:19:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 03:19:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 03:19:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-29 03:19:39,816 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 19 [2023-11-29 03:19:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:39,817 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-29 03:19:39,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 03:19:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-29 03:19:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:19:39,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:39,819 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 03:19:39,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:19:40,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558312, now seen corresponding path program 1 times [2023-11-29 03:19:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:19:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431322674] [2023-11-29 03:19:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:40,022 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 03:19:40,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:19:40,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:40,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:19:40,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:40,244 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 03:19:40,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:19:40,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:19:40,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431322674] [2023-11-29 03:19:40,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431322674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:40,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:19:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393658511] [2023-11-29 03:19:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:40,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:19:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:19:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:19:40,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:19:40,249 INFO L87 Difference]: Start difference. First operand 25 states and 33 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 03:19:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:40,413 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2023-11-29 03:19:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:19:40,414 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 03:19:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:40,415 INFO L225 Difference]: With dead ends: 47 [2023-11-29 03:19:40,415 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 03:19:40,416 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 03:19:40,417 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:19:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 03:19:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-11-29 03:19:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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 03:19:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-29 03:19:40,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-11-29 03:19:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:40,431 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-29 03:19:40,431 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 03:19:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-29 03:19:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:19:40,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:40,432 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 03:19:40,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:19:40,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash 119173117, now seen corresponding path program 1 times [2023-11-29 03:19:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:19:40,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344264954] [2023-11-29 03:19:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:40,638 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 03:19:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:19:40,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:40,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:19:40,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:40,928 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 03:19:40,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:19:40,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:19:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344264954] [2023-11-29 03:19:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344264954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:19:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:19:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:19:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249512526] [2023-11-29 03:19:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:19:40,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:19:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:19:40,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:19:40,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:19:40,932 INFO L87 Difference]: Start difference. First operand 26 states and 34 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 03:19:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:41,128 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-11-29 03:19:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:19:41,128 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 03:19:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:41,129 INFO L225 Difference]: With dead ends: 37 [2023-11-29 03:19:41,129 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 03:19:41,130 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 03:19:41,131 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:41,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:19:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 03:19:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 03:19:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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 03:19:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-29 03:19:41,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 27 [2023-11-29 03:19:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:41,139 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-29 03:19:41,139 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 03:19:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-29 03:19:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:19:41,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:41,141 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 03:19:41,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:41,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:41,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:19:41,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash 935091600, now seen corresponding path program 1 times [2023-11-29 03:19:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:19:41,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345457826] [2023-11-29 03:19:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:41,347 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 03:19:41,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:19:41,348 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:41,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:19:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:41,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 03:19:41,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:41,738 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 03:19:41,954 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 03:19:42,074 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:19:42,075 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 03:19:42,221 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 03:19:42,235 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 03:19:42,355 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 03:19:42,375 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 03:19:42,698 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2023-11-29 03:19:42,698 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 164 treesize of output 74 [2023-11-29 03:19:42,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:42,720 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 03:19:42,729 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 03:19:42,912 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 03:19:42,912 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 51 treesize of output 26 [2023-11-29 03:19:42,926 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 03:19:42,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 03:19:43,237 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:19:43,238 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 03:19:43,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:43,307 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 03:19:43,308 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 59 treesize of output 48 [2023-11-29 03:19:43,361 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 03:19:43,361 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 03:19:43,883 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 03:19:43,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2023-11-29 03:19:44,172 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 64 treesize of output 26 [2023-11-29 03:19:44,178 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 03:19:44,301 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 03:19:44,453 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 03:19:44,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:19:44,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (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|)))) (= (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_350) (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_348) (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|))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-11-29 03:19:45,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (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 (= v_ArrVal_349 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_358) .cse0) .cse1 (select v_ArrVal_349 .cse1)))) (= |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_350) (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_348) (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 03:19:45,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:19:45,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345457826] [2023-11-29 03:19:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345457826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:19:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1403749679] [2023-11-29 03:19:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:45,525 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:19:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:19:45,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:19:45,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-29 03:19:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:46,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 03:19:46,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:46,108 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 03:19:46,347 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 03:19:46,402 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:19:46,402 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 03:19:46,573 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 03:19:46,596 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 03:19:46,750 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 03:19:46,759 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 03:19:47,165 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2023-11-29 03:19:47,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 126 [2023-11-29 03:19:47,183 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-11-29 03:19:47,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 92 [2023-11-29 03:19:47,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:47,197 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 03:19:47,203 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 03:19:47,211 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 03:19:47,366 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 03:19:47,373 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 03:19:47,380 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 03:19:51,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:51,774 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 03:19:51,807 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 03:19:51,808 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 03:19:51,841 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 03:19:52,407 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 03:19:52,711 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-11-29 03:19:52,722 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 03:19:52,901 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 03:19:52,917 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 03:19:52,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:19:53,988 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_474 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_475 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (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|))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_483) .cse0) .cse1 v_ArrVal_475)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_473) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_16| v_ArrVal_484) .cse0) .cse1) v_ArrVal_474)) (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 03:19:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1403749679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:19:54,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:19:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2023-11-29 03:19:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080883779] [2023-11-29 03:19:54,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:19:54,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 03:19:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:19:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 03:19:54,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1971, Unknown=45, NotChecked=276, Total=2450 [2023-11-29 03:19:54,005 INFO L87 Difference]: Start difference. First operand 27 states and 35 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 03:20:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:14,717 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-11-29 03:20:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:20:14,718 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 03:20:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:14,720 INFO L225 Difference]: With dead ends: 59 [2023-11-29 03:20:14,720 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 03:20:14,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=273, Invalid=3234, Unknown=45, NotChecked=354, Total=3906 [2023-11-29 03:20:14,723 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:14,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 230 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 18.9s Time] [2023-11-29 03:20:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 03:20:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2023-11-29 03:20:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 03:20:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2023-11-29 03:20:14,733 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 28 [2023-11-29 03:20:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2023-11-29 03:20:14,733 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 03:20:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2023-11-29 03:20:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:20:14,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:14,735 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 03:20:14,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-11-29 03:20:14,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:15,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:15,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:15,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 458760797, now seen corresponding path program 2 times [2023-11-29 03:20:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853898014] [2023-11-29 03:20:15,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:20:15,142 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 03:20:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:15,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:15,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:15,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:20:15,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:20:15,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:20:15,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:15,386 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 03:20:15,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:16,015 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 03:20:16,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853898014] [2023-11-29 03:20:16,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853898014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:16,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:20:16,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 03:20:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719444339] [2023-11-29 03:20:16,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:16,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:20:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:16,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:20:16,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:20:16,017 INFO L87 Difference]: Start difference. First operand 44 states and 57 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 03:20:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:16,347 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2023-11-29 03:20:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:20:16,348 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 03:20:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:16,349 INFO L225 Difference]: With dead ends: 55 [2023-11-29 03:20:16,349 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 03:20:16,349 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 03:20:16,350 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:16,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 95 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:20:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 03:20:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-29 03:20:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 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 03:20:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-11-29 03:20:16,362 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 29 [2023-11-29 03:20:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:16,362 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-29 03:20:16,363 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 03:20:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2023-11-29 03:20:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:20:16,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:16,364 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 03:20:16,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:20:16,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:16,565 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:16,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash 976741128, now seen corresponding path program 1 times [2023-11-29 03:20:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093586950] [2023-11-29 03:20:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:16,566 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 03:20:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:16,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:16,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:20:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:16,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:20:16,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:16,856 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 03:20:17,022 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:20:17,022 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 03:20:17,087 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 03:20:17,149 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 03:20:17,303 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2023-11-29 03:20:17,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 89 [2023-11-29 03:20:17,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-29 03:20:17,572 INFO L349 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2023-11-29 03:20:17,572 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 358 treesize of output 352 [2023-11-29 03:20:17,618 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 03:20:17,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 319 treesize of output 311 [2023-11-29 03:20:17,676 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 03:20:17,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 311 [2023-11-29 03:20:17,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:20:17,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:20:17,747 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 48 treesize of output 64 [2023-11-29 03:20:17,936 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 18 treesize of output 14 [2023-11-29 03:20:18,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:20:18,227 INFO L349 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-11-29 03:20:18,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 435 treesize of output 424 [2023-11-29 03:20:18,284 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 03:20:18,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 296 [2023-11-29 03:20:18,349 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 03:20:18,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 297 treesize of output 295 [2023-11-29 03:20:18,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:20:18,532 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-11-29 03:20:18,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 93 [2023-11-29 03:20:18,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:20:18,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-29 03:20:19,293 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 110 treesize of output 52 [2023-11-29 03:20:19,346 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 03:20:19,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 73 [2023-11-29 03:20:19,542 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:20:19,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:20:19,723 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 100 treesize of output 60 [2023-11-29 03:20:19,731 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-11-29 03:20:19,732 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 22 [2023-11-29 03:20:19,792 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 03:20:19,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:21,245 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_694 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24| (_ BitVec 32))) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24| v_ArrVal_694)) (.cse1 (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 ((.cse5 (select .cse3 .cse1)) (.cse6 (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 (select .cse5 .cse6))) (store (let ((.cse2 (store .cse5 .cse6 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24|))) (store (store |c_#memory_$Pointer$#1.base| .cse1 .cse2) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24| (store (store (select (store .cse3 .cse1 .cse2) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_24|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse4))) .cse4 v_ArrVal_686)))) .cse0) (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_24|))))) is different from false [2023-11-29 03:20:21,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093586950] [2023-11-29 03:20:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093586950] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [296183568] [2023-11-29 03:20:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:20:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:20:21,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:20:21,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-29 03:20:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:21,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 03:20:21,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:21,842 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 03:20:22,121 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:20:22,122 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 03:20:22,285 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 03:20:22,444 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 03:20:22,794 INFO L349 Elim1Store]: treesize reduction 86, result has 9.5 percent of original size [2023-11-29 03:20:22,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 89 [2023-11-29 03:20:22,803 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 20 treesize of output 19 [2023-11-29 03:20:22,814 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-11-29 03:20:22,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 54 [2023-11-29 03:20:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-29 03:20:22,824 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 03:20:22,990 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 03:20:22,995 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 03:20:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:20:27,491 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 03:20:27,520 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 03:20:27,521 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 03:20:28,210 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 74 treesize of output 37 [2023-11-29 03:20:28,236 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-11-29 03:20:28,236 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 58 treesize of output 31 [2023-11-29 03:20:28,425 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:20:28,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:20:28,595 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 35 treesize of output 19 [2023-11-29 03:20:28,597 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 03:20:28,600 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 03:20:28,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:33,496 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28|) (_ bv0 1))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (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 ((.cse2 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28| v_ArrVal_806) .cse1)) (.cse3 (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|))) (store (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 .cse3 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_28| v_ArrVal_803) (select .cse2 .cse3) v_ArrVal_800))) .cse0) (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 03:20:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [296183568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:33,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:20:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 39 [2023-11-29 03:20:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669822996] [2023-11-29 03:20:33,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:33,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 03:20:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 03:20:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1961, Unknown=49, NotChecked=182, Total=2352 [2023-11-29 03:20:33,504 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 30 states have internal predecessors, (41), 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 03:20:57,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:03,246 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2023-11-29 03:21:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:21:03,248 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.28125) internal successors, (41), 30 states have internal predecessors, (41), 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 30 [2023-11-29 03:21:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:03,249 INFO L225 Difference]: With dead ends: 58 [2023-11-29 03:21:03,250 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 03:21:03,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=242, Invalid=2902, Unknown=56, NotChecked=222, Total=3422 [2023-11-29 03:21:03,252 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 11 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:03,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 363 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 790 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2023-11-29 03:21:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 03:21:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2023-11-29 03:21:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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 03:21:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-11-29 03:21:03,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 30 [2023-11-29 03:21:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:03,263 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-11-29 03:21:03,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.28125) internal successors, (41), 30 states have internal predecessors, (41), 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 03:21:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-11-29 03:21:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:21:03,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:03,265 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 03:21:03,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:21:03,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-11-29 03:21:03,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:21:03,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:21:03,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1722660074, now seen corresponding path program 1 times [2023-11-29 03:21:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936034229] [2023-11-29 03:21:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:03,667 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 03:21:03,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:03,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:21:03,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 (10)] Waiting until timeout for monitored process [2023-11-29 03:21:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:03,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:21:03,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:03,975 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 03:21:04,011 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 03:21:04,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:04,070 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 03:21:04,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936034229] [2023-11-29 03:21:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936034229] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:21:04,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:21:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2023-11-29 03:21:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946428667] [2023-11-29 03:21:04,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:21:04,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:21:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:21:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:21:04,072 INFO L87 Difference]: Start difference. First operand 45 states and 56 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 03:21:09,192 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 03:21:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:11,944 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-11-29 03:21:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:21:11,945 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 03:21:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:11,946 INFO L225 Difference]: With dead ends: 69 [2023-11-29 03:21:11,946 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 03:21:11,946 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 03:21:11,947 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:11,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2023-11-29 03:21:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 03:21:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 03:21:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 03:21:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-11-29 03:21:11,955 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 30 [2023-11-29 03:21:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:11,956 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-11-29 03:21:11,956 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 03:21:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-11-29 03:21:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:21:11,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:11,957 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, 1, 1] [2023-11-29 03:21:11,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 (10)] Ended with exit code 0 [2023-11-29 03:21:12,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:21:12,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:21:12,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash 214245073, now seen corresponding path program 1 times [2023-11-29 03:21:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050004180] [2023-11-29 03:21:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:12,158 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 03:21:12,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:12,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 03:21:12,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10d55bc-85d4-42c1-92ff-295784438d43/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 (11)] Waiting until timeout for monitored process [2023-11-29 03:21:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:12,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 03:21:12,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:12,489 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 03:21:12,681 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:21:12,682 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 03:21:12,790 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 03:21:12,918 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 03:21:13,255 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2023-11-29 03:21:13,255 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 115 treesize of output 41 [2023-11-29 03:21:13,467 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-29 03:21:13,467 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 51 treesize of output 26 [2023-11-29 03:21:13,477 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 03:21:13,673 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 03:21:13,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:21:13,865 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 03:21:13,865 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 59 treesize of output 48 [2023-11-29 03:21:13,930 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 03:21:13,931 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 03:21:14,966 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 03:21:14,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:21:14,994 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 60 treesize of output 14 [2023-11-29 03:21:15,040 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-11-29 03:21:15,041 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 67 [2023-11-29 03:21:15,084 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-11-29 03:21:15,085 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 126 treesize of output 73 [2023-11-29 03:21:15,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-29 03:21:15,104 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 03:21:15,120 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 03:21:15,273 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 03:21:15,426 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 03:21:15,432 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 03:21:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:15,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:15,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:15,910 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 03:21:15,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:15,973 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 03:21:15,988 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 03:21:16,008 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 03:21:23,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse2 (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|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (.cse9 (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (not .cse9)) (.cse14 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (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_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse22 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse22 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse24 (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse13 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (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_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (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_1019))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_137 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))) (.cse7 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (let ((.cse6 (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse9) (or (and (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) .cse9) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (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_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse11 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse13)) (or (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) .cse14) (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse7)) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (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_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)) .cse7)) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) .cse9)) .cse13) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (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_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) .cse14) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (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_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1013) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1017) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse20 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1020 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))))) is different from false [2023-11-29 03:21:30,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse6 |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|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#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|)) (.cse11 (= .cse6 .cse4))) (let ((.cse13 (and (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) .cse8) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse11))) (.cse17 (not .cse11)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse8 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))) (or .cse13 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or .cse13 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse8)) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse21 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))))) is different from false [2023-11-29 03:21:34,443 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse6 |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|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#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|)) (.cse11 (= .cse6 .cse4))) (let ((.cse13 (and (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) .cse8) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) .cse11))) (.cse17 (not .cse11)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (bvadd v_arrayElimCell_138 (_ bv8 32))))))))))) (or .cse8 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))) (or .cse13 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or .cse13 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_139 (_ bv8 32)))) (not (= (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 (bvadd v_arrayElimCell_138 (_ bv8 32)))))))) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (not .cse8)) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))))) (or .cse17 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)) (bvadd v_arrayElimCell_138 (_ bv8 32)))) (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1019))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) .cse4 v_ArrVal_1013) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1021) .cse4 v_ArrVal_1017) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 (bvadd v_arrayElimCell_139 (_ bv8 32)))) (= (select .cse21 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1020 .cse1)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020)))))))))))) is different from true [2023-11-29 03:21:40,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (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 ((.cse32 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse17 (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 ((.cse5 (select .cse32 .cse17)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse32 .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse11 (= .cse7 .cse5))) (let ((.cse14 (not .cse11)) (.cse4 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv8 32))) (.cse18 (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd v_arrayElimCell_139 (_ bv8 32))))))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32))))))) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))) (or .cse0 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse30 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))))))))) (and (or .cse0 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse3 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))) .cse11))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= (select .cse13 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (bvadd v_arrayElimCell_139 (_ bv8 32)))))))) .cse14) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse16 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse16 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (bvadd v_arrayElimCell_139 (_ bv8 32)))))))))) (or (= .cse8 .cse17) .cse18) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_139 (_ bv8 32)))))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse20 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (bvadd v_arrayElimCell_139 (_ bv8 32))))))) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)))))) (not .cse0)) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= (select (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse14) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse23 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 (bvadd v_arrayElimCell_139 (_ bv8 32))))))))) (or (= .cse7 .cse9) .cse18))))))) is different from false [2023-11-29 03:21:44,396 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (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 ((.cse32 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse17 (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 ((.cse5 (select .cse32 .cse17)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse32 .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) (.cse11 (= .cse7 .cse5))) (let ((.cse14 (not .cse11)) (.cse4 (bvadd |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (_ bv8 32))) (.cse18 (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 (bvadd v_arrayElimCell_139 (_ bv8 32))))))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse27 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 (bvadd v_arrayElimCell_139 (_ bv8 32))))))) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))) (or .cse0 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 (bvadd v_arrayElimCell_137 (_ bv8 32)))) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse30 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_137 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_137 (_ bv8 32)))) (not (= (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))))))))) (and (or .cse0 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse3 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020))))) .cse11))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse13 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= (select .cse13 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (bvadd v_arrayElimCell_139 (_ bv8 32)))))))) .cse14) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse16 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse16 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (bvadd v_arrayElimCell_139 (_ bv8 32)))))))))) (or (= .cse8 .cse17) .cse18) (or (and (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_139 (_ bv8 32)))))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (forall ((v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_138 (_ BitVec 32))) (= (select .cse20 (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 (bvadd v_arrayElimCell_139 (_ bv8 32))))))) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)))))) (not .cse0)) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_138 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (or (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= (select (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)) (bvadd v_arrayElimCell_138 (_ bv8 32))) |c_ULTIMATE.start_main_~data~0#1|)))) .cse14) (or .cse11 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_139 (_ BitVec 32)) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| .cse9 v_ArrVal_1019))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1020) .cse5 v_ArrVal_1013) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1021) .cse5 v_ArrVal_1017) .cse7) .cse8)))) (or (= (select .cse23 .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 (select v_ArrVal_1020 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1020)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 (bvadd v_arrayElimCell_139 (_ bv8 32))))))))) (or (= .cse7 .cse9) .cse18))))))) is different from true