./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB --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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:32:53,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:32:53,368 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:32:53,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:32:53,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:32:53,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:32:53,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:32:53,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:32:53,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:32:53,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:32:53,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:32:53,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:32:53,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:32:53,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:32:53,405 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:32:53,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:32:53,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:32:53,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:32:53,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:32:53,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:32:53,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:32:53,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:32:53,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:32:53,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:32:53,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:32:53,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:32:53,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:32:53,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:32:53,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:32:53,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:32:53,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:32:53,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:32:53,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:32:53,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:32:53,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:32:53,410 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-11-28 02:32:53,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:32:53,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:32:53,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:32:53,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:32:53,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:32:53,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-28 02:32:56,692 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/data/b34174381/0ed1339d31754e2081a5e60a308a73d2/FLAG889f31fde [2024-11-28 02:32:57,094 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:32:57,095 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-28 02:32:57,113 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/data/b34174381/0ed1339d31754e2081a5e60a308a73d2/FLAG889f31fde [2024-11-28 02:32:57,138 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/data/b34174381/0ed1339d31754e2081a5e60a308a73d2 [2024-11-28 02:32:57,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:32:57,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:32:57,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:32:57,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:32:57,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:32:57,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9f3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57, skipping insertion in model container [2024-11-28 02:32:57,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:32:57,591 WARN L250 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_01c995bc-ab1d-497e-af0a-301388673f7d/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2024-11-28 02:32:57,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:32:57,609 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:32:57,675 WARN L250 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_01c995bc-ab1d-497e-af0a-301388673f7d/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2024-11-28 02:32:57,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:32:57,708 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:32:57,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57 WrapperNode [2024-11-28 02:32:57,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:32:57,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:32:57,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:32:57,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:32:57,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,756 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-28 02:32:57,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:32:57,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:32:57,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:32:57,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:32:57,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,790 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-11-28 02:32:57,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:32:57,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:32:57,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:32:57,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:32:57,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (1/1) ... [2024-11-28 02:32:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:32:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:32:57,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:32:57,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:32:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:32:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:32:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:32:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:32:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:32:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:32:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 02:32:57,874 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 02:32:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:32:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:32:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:32:57,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:32:58,039 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:32:58,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:32:58,343 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-28 02:32:58,343 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:32:58,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:32:58,357 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 02:32:58,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:32:58 BoogieIcfgContainer [2024-11-28 02:32:58,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:32:58,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:32:58,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:32:58,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:32:58,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:32:57" (1/3) ... [2024-11-28 02:32:58,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e14c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:32:58, skipping insertion in model container [2024-11-28 02:32:58,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:32:57" (2/3) ... [2024-11-28 02:32:58,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e14c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:32:58, skipping insertion in model container [2024-11-28 02:32:58,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:32:58" (3/3) ... [2024-11-28 02:32:58,368 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-28 02:32:58,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:32:58,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 39 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-28 02:32:58,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:32:58,466 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@65180cef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:32:58,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:32:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 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) [2024-11-28 02:32:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 02:32:58,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:32:58,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:32:58,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:32:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:32:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 824060162, now seen corresponding path program 1 times [2024-11-28 02:32:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:32:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319879218] [2024-11-28 02:32:58,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:32:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:32:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:32:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:32:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:32:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319879218] [2024-11-28 02:32:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319879218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:32:58,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:32:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:32:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457103067] [2024-11-28 02:32:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:32:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:32:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:32:58,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:32:58,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:32:58,749 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:32:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:32:58,769 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-28 02:32:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:32:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-28 02:32:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:32:58,778 INFO L225 Difference]: With dead ends: 71 [2024-11-28 02:32:58,780 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 02:32:58,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:32:58,787 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:32:58,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:32:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 02:32:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-28 02:32:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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) [2024-11-28 02:32:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-28 02:32:58,829 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2024-11-28 02:32:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:32:58,829 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-28 02:32:58,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:32:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-28 02:32:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 02:32:58,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:32:58,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:32:58,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:32:58,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:32:58,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:32:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash -86692362, now seen corresponding path program 1 times [2024-11-28 02:32:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:32:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648242976] [2024-11-28 02:32:58,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:32:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:32:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:32:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:32:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:32:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648242976] [2024-11-28 02:32:59,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648242976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:32:59,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:32:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:32:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035829116] [2024-11-28 02:32:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:32:59,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:32:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:32:59,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:32:59,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:32:59,177 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:32:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:32:59,202 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-11-28 02:32:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:32:59,203 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-28 02:32:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:32:59,203 INFO L225 Difference]: With dead ends: 62 [2024-11-28 02:32:59,203 INFO L226 Difference]: Without dead ends: 37 [2024-11-28 02:32:59,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:32:59,205 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:32:59,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:32:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-28 02:32:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-11-28 02:32:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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) [2024-11-28 02:32:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-28 02:32:59,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2024-11-28 02:32:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:32:59,218 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-28 02:32:59,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:32:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-28 02:32:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 02:32:59,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:32:59,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:32:59,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:32:59,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:32:59,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:32:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash -213222233, now seen corresponding path program 1 times [2024-11-28 02:32:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:32:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60857657] [2024-11-28 02:32:59,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:32:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:32:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:32:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:32:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:32:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60857657] [2024-11-28 02:32:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60857657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:32:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:32:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:32:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041589729] [2024-11-28 02:32:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:32:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:32:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:32:59,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:32:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:32:59,363 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-28 02:32:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:32:59,386 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-11-28 02:32:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:32:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 27 [2024-11-28 02:32:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:32:59,387 INFO L225 Difference]: With dead ends: 66 [2024-11-28 02:32:59,387 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 02:32:59,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:32:59,388 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:32:59,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:32:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 02:32:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-28 02:32:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:32:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-28 02:32:59,397 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-11-28 02:32:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:32:59,397 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-28 02:32:59,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-28 02:32:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-28 02:32:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 02:32:59,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:32:59,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:32:59,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:32:59,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:32:59,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:32:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1801570135, now seen corresponding path program 1 times [2024-11-28 02:32:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:32:59,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110222623] [2024-11-28 02:32:59,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:32:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:32:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:32:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:32:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:32:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110222623] [2024-11-28 02:32:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110222623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:32:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221543398] [2024-11-28 02:32:59,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:32:59,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:32:59,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:32:59,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:32:59,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:32:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:32:59,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:32:59,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:00,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:33:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221543398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:33:00,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:33:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 02:33:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433454111] [2024-11-28 02:33:00,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:33:00,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:33:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:33:00,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:33:00,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:33:00,066 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:33:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:00,099 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-11-28 02:33:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:33:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-28 02:33:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:00,102 INFO L225 Difference]: With dead ends: 63 [2024-11-28 02:33:00,102 INFO L226 Difference]: Without dead ends: 38 [2024-11-28 02:33:00,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:33:00,103 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:00,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:33:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-28 02:33:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-28 02:33:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:33:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-28 02:33:00,114 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 27 [2024-11-28 02:33:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:00,114 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-28 02:33:00,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:33:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-28 02:33:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 02:33:00,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:00,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:33:00,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:33:00,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-28 02:33:00,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:33:00,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1330117734, now seen corresponding path program 1 times [2024-11-28 02:33:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:33:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174725156] [2024-11-28 02:33:00,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:33:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 02:33:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:33:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174725156] [2024-11-28 02:33:00,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174725156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872892685] [2024-11-28 02:33:00,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:00,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:00,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:33:00,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:33:00,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:33:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:01,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:33:01,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:01,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 02:33:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:33:01,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 02:33:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872892685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:33:01,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:33:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2024-11-28 02:33:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615272540] [2024-11-28 02:33:01,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:33:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:33:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:33:01,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:33:01,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:33:01,409 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:33:05,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:33:09,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:33:13,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:33:17,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:33:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:17,780 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2024-11-28 02:33:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:33:17,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-28 02:33:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:17,782 INFO L225 Difference]: With dead ends: 73 [2024-11-28 02:33:17,782 INFO L226 Difference]: Without dead ends: 43 [2024-11-28 02:33:17,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:33:17,784 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:17,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 293 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-28 02:33:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-28 02:33:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-28 02:33:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:33:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-28 02:33:17,794 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2024-11-28 02:33:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:17,795 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-28 02:33:17,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:33:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-28 02:33:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 02:33:17,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:17,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:33:17,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:33:18,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:18,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:33:18,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash -753757329, now seen corresponding path program 1 times [2024-11-28 02:33:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:33:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733151713] [2024-11-28 02:33:18,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:33:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:21,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:33:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733151713] [2024-11-28 02:33:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733151713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912732563] [2024-11-28 02:33:21,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:21,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:33:21,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:33:21,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:33:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:21,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-28 02:33:21,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:21,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:33:21,679 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:33:21,679 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:33:21,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:33:21,919 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:33:21,919 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 42 treesize of output 39 [2024-11-28 02:33:22,324 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 42 treesize of output 18 [2024-11-28 02:33:22,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:33:22,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:33:22,689 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 33 [2024-11-28 02:33:22,720 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 02:33:22,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 02:33:23,566 INFO L349 Elim1Store]: treesize reduction 47, result has 38.2 percent of original size [2024-11-28 02:33:23,567 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 76 treesize of output 69 [2024-11-28 02:33:23,581 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 49 treesize of output 32 [2024-11-28 02:33:23,707 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 40 treesize of output 24 [2024-11-28 02:33:23,713 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 24 treesize of output 12 [2024-11-28 02:33:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:23,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:24,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912732563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:24,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:33:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 40 [2024-11-28 02:33:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27307548] [2024-11-28 02:33:24,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:33:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 02:33:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:33:24,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 02:33:24,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2005, Unknown=6, NotChecked=0, Total=2162 [2024-11-28 02:33:24,821 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 40 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 33 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:33:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:27,165 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-11-28 02:33:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 02:33:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 33 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-28 02:33:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:27,167 INFO L225 Difference]: With dead ends: 61 [2024-11-28 02:33:27,167 INFO L226 Difference]: Without dead ends: 49 [2024-11-28 02:33:27,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=298, Invalid=3602, Unknown=6, NotChecked=0, Total=3906 [2024-11-28 02:33:27,171 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:27,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 604 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 02:33:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-28 02:33:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-28 02:33:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:33:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-28 02:33:27,181 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 40 [2024-11-28 02:33:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-28 02:33:27,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 33 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:33:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-28 02:33:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 02:33:27,183 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:27,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:33:27,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:33:27,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:27,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:33:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 67800126, now seen corresponding path program 1 times [2024-11-28 02:33:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:33:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421654789] [2024-11-28 02:33:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:33:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:33:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421654789] [2024-11-28 02:33:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421654789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599701749] [2024-11-28 02:33:29,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:29,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:33:29,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:33:29,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:33:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:30,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-28 02:33:30,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:30,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:33:30,388 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:33:30,389 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:33:30,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:33:30,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:33:30,569 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 52 treesize of output 49 [2024-11-28 02:33:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 18 [2024-11-28 02:33:30,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:33:31,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:33:31,039 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 68 treesize of output 51 [2024-11-28 02:33:31,061 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 02:33:31,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 02:33:31,574 INFO L349 Elim1Store]: treesize reduction 53, result has 39.8 percent of original size [2024-11-28 02:33:31,575 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 86 treesize of output 71 [2024-11-28 02:33:31,587 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 67 treesize of output 50 [2024-11-28 02:33:31,686 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 58 treesize of output 42 [2024-11-28 02:33:31,689 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 42 treesize of output 30 [2024-11-28 02:33:31,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-28 02:33:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:33:31,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599701749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:32,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:33:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2024-11-28 02:33:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452344475] [2024-11-28 02:33:32,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:33:32,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 02:33:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:33:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 02:33:32,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1920, Unknown=15, NotChecked=0, Total=2070 [2024-11-28 02:33:32,454 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:33:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:34,480 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-11-28 02:33:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 02:33:34,481 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2024-11-28 02:33:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:34,482 INFO L225 Difference]: With dead ends: 55 [2024-11-28 02:33:34,482 INFO L226 Difference]: Without dead ends: 52 [2024-11-28 02:33:34,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=355, Invalid=4052, Unknown=15, NotChecked=0, Total=4422 [2024-11-28 02:33:34,485 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 67 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:34,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 492 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:33:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-28 02:33:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2024-11-28 02:33:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:33:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-28 02:33:34,500 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 43 [2024-11-28 02:33:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:34,500 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-28 02:33:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:33:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-28 02:33:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:33:34,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:34,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:33:34,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 02:33:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:34,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:33:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash 399814863, now seen corresponding path program 1 times [2024-11-28 02:33:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:33:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688740494] [2024-11-28 02:33:34,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:33:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:33:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688740494] [2024-11-28 02:33:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688740494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991748057] [2024-11-28 02:33:36,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:36,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:33:36,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:33:36,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:33:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:37,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-11-28 02:33:37,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:37,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:33:38,086 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:33:38,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:33:38,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-28 02:33:38,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:33:38,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:33:38,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:33:38,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:33:38,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:33:38,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:33:39,020 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 02:33:39,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 02:33:39,047 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-28 02:33:39,047 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 20 treesize of output 22 [2024-11-28 02:33:39,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 02:33:39,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:33:39,806 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 27 treesize of output 20 [2024-11-28 02:33:39,811 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 30 treesize of output 23 [2024-11-28 02:33:39,839 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-28 02:33:39,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1 [2024-11-28 02:33:39,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-28 02:33:40,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 02:33:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:40,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:33:40,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (= v_ArrVal_950 (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_950 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_951) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2024-11-28 02:33:40,472 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 83 treesize of output 65 [2024-11-28 02:33:40,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_arrayElimCell_55 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 4))) (or (not (= v_ArrVal_950 (store (select |c_#memory_int#1| v_arrayElimCell_55) .cse0 (select v_ArrVal_950 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_55 v_ArrVal_950) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_951) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_55) .cse0) 0))))) is different from false [2024-11-28 02:33:40,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_arrayElimCell_55 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_55 v_ArrVal_950) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_951) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_55) .cse0) 0)) (not (= v_ArrVal_950 (store (select |c_#memory_int#1| v_arrayElimCell_55) .cse0 (select v_ArrVal_950 .cse0))))))) is different from false [2024-11-28 02:33:40,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_arrayElimCell_55 Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_55 v_ArrVal_950) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_951) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_55) .cse0) 0)) (not (= v_ArrVal_950 (store (select |c_#memory_int#1| v_arrayElimCell_55) .cse0 (select v_ArrVal_950 .cse0))))))) is different from false [2024-11-28 02:33:40,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_961 (Array Int Int)) (v_ArrVal_950 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_961))) (let ((.cse1 (+ (select (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4))) (or (not (= (select (select .cse0 v_arrayElimCell_55) .cse1) 0)) (not (= v_ArrVal_950 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_960) v_arrayElimCell_55) .cse1 (select v_ArrVal_950 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26|) 0)) (= (select (select (store (store |c_#memory_int#1| v_arrayElimCell_55 v_ArrVal_950) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_951) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2024-11-28 02:33:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991748057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:40,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:33:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 54 [2024-11-28 02:33:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728624695] [2024-11-28 02:33:40,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:33:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 02:33:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:33:40,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 02:33:40,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2987, Unknown=5, NotChecked=570, Total=3782 [2024-11-28 02:33:40,629 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 states have internal predecessors, (74), 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) [2024-11-28 02:33:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:42,684 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-28 02:33:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 02:33:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 states have internal predecessors, (74), 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 46 [2024-11-28 02:33:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:42,686 INFO L225 Difference]: With dead ends: 71 [2024-11-28 02:33:42,686 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 02:33:42,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=361, Invalid=4766, Unknown=5, NotChecked=720, Total=5852 [2024-11-28 02:33:42,688 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:42,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 541 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:33:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 02:33:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2024-11-28 02:33:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:33:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-28 02:33:42,698 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 46 [2024-11-28 02:33:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:42,699 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-28 02:33:42,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 states have internal predecessors, (74), 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) [2024-11-28 02:33:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-28 02:33:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 02:33:42,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:42,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:33:42,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:33:42,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:42,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:33:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 399883373, now seen corresponding path program 1 times [2024-11-28 02:33:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:33:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486912020] [2024-11-28 02:33:42,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:33:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:33:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:33:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 02:33:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:33:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486912020] [2024-11-28 02:33:43,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486912020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:33:43,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:33:43,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:33:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494637358] [2024-11-28 02:33:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:33:43,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:33:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:33:43,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:33:43,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:33:43,053 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-28 02:33:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:33:43,123 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-28 02:33:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:33:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 46 [2024-11-28 02:33:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:33:43,125 INFO L225 Difference]: With dead ends: 66 [2024-11-28 02:33:43,125 INFO L226 Difference]: Without dead ends: 61 [2024-11-28 02:33:43,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:33:43,125 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:33:43,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:33:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-28 02:33:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-28 02:33:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:33:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-28 02:33:43,145 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2024-11-28 02:33:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:33:43,145 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-28 02:33:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-28 02:33:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-28 02:33:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 02:33:43,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:33:43,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:33:43,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:33:43,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:33:43,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:33:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1125945950, now seen corresponding path program 2 times [2024-11-28 02:33:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:33:43,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396993208] [2024-11-28 02:33:43,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:33:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:33:43,224 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:33:43,226 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:33:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:33:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396993208] [2024-11-28 02:33:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396993208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:33:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050077125] [2024-11-28 02:33:46,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:33:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:33:46,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:33:46,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:33:46,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:33:47,054 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:33:47,054 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:33:47,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-28 02:33:47,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:33:47,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:33:47,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:33:47,703 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:33:47,703 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:33:47,720 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 18 treesize of output 13 [2024-11-28 02:33:47,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-28 02:33:47,818 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 18 treesize of output 13 [2024-11-28 02:33:47,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-11-28 02:33:47,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:33:47,995 INFO L349 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2024-11-28 02:33:47,995 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 114 treesize of output 71 [2024-11-28 02:33:48,005 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 63 treesize of output 44 [2024-11-28 02:33:48,017 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 28 treesize of output 11 [2024-11-28 02:33:48,608 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-11-28 02:33:48,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 27 [2024-11-28 02:33:48,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2024-11-28 02:33:48,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:33:53,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:33:53,034 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:33:53,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 101 [2024-11-28 02:33:53,051 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 02:33:53,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 02:33:53,066 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 87 treesize of output 76 [2024-11-28 02:33:53,094 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 24 treesize of output 19 [2024-11-28 02:33:53,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 54 [2024-11-28 02:33:54,120 INFO L349 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2024-11-28 02:33:54,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 26 [2024-11-28 02:33:54,311 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 29 treesize of output 19 [2024-11-28 02:33:54,324 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 19 [2024-11-28 02:33:54,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:33:54,471 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 39 treesize of output 31 [2024-11-28 02:33:54,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-28 02:33:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:33:54,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:34:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050077125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:34:04,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:34:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2024-11-28 02:34:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071479299] [2024-11-28 02:34:04,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:34:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 02:34:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:34:04,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 02:34:04,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3607, Unknown=112, NotChecked=0, Total=3906 [2024-11-28 02:34:04,283 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 55 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:34:08,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:34:16,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:34:20,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:34:28,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 02:34:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:34:40,940 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-28 02:34:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 02:34:40,940 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2024-11-28 02:34:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:34:40,941 INFO L225 Difference]: With dead ends: 112 [2024-11-28 02:34:40,941 INFO L226 Difference]: Without dead ends: 110 [2024-11-28 02:34:40,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=363, Invalid=6657, Unknown=120, NotChecked=0, Total=7140 [2024-11-28 02:34:40,945 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 59 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 19 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:34:40,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 891 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1599 Invalid, 4 Unknown, 0 Unchecked, 18.2s Time] [2024-11-28 02:34:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-28 02:34:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2024-11-28 02:34:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 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) [2024-11-28 02:34:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-11-28 02:34:40,970 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 49 [2024-11-28 02:34:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:34:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-11-28 02:34:40,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:34:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-11-28 02:34:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 02:34:40,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:34:40,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:34:40,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:34:41,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:34:41,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:34:41,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:34:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -898793497, now seen corresponding path program 1 times [2024-11-28 02:34:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:34:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444657512] [2024-11-28 02:34:41,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:34:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:34:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:34:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:34:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:34:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444657512] [2024-11-28 02:34:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444657512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:34:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868305929] [2024-11-28 02:34:44,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:34:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:34:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:34:44,818 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:34:44,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:34:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:34:45,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 171 conjuncts are in the unsatisfiable core [2024-11-28 02:34:45,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:34:45,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:34:45,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:34:45,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:34:45,466 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 26 treesize of output 11 [2024-11-28 02:34:45,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:34:45,934 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:34:45,935 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 02:34:45,957 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:34:45,957 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 02:34:45,983 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:34:45,984 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:34:45,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:34:46,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2024-11-28 02:34:46,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:34:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:34:46,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-28 02:34:46,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:34:46,301 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-28 02:34:46,302 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 150 treesize of output 83 [2024-11-28 02:34:46,309 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 47 treesize of output 17 [2024-11-28 02:34:46,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-28 02:34:47,019 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-28 02:34:47,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 56 [2024-11-28 02:34:47,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-11-28 02:34:47,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 02:34:47,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:34:47,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:34:47,390 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:34:47,390 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 181 treesize of output 130 [2024-11-28 02:34:47,445 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2024-11-28 02:34:47,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 80 [2024-11-28 02:34:47,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:34:47,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 15 treesize of output 11 [2024-11-28 02:34:47,525 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-28 02:34:47,525 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 1 case distinctions, treesize of input 30 treesize of output 43 [2024-11-28 02:34:47,572 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-28 02:34:47,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-28 02:34:49,099 INFO L349 Elim1Store]: treesize reduction 37, result has 11.9 percent of original size [2024-11-28 02:34:49,100 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 142 [2024-11-28 02:34:49,155 INFO L349 Elim1Store]: treesize reduction 46, result has 28.1 percent of original size [2024-11-28 02:34:49,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 115 [2024-11-28 02:34:49,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:34:49,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 02:34:49,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 02:34:49,343 INFO L349 Elim1Store]: treesize reduction 376, result has 15.5 percent of original size [2024-11-28 02:34:49,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 172 treesize of output 150 [2024-11-28 02:34:49,403 INFO L349 Elim1Store]: treesize reduction 89, result has 9.2 percent of original size [2024-11-28 02:34:49,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 140 [2024-11-28 02:34:49,578 INFO L349 Elim1Store]: treesize reduction 182, result has 27.2 percent of original size [2024-11-28 02:34:49,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 207 treesize of output 146 [2024-11-28 02:34:49,622 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:34:49,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 232 treesize of output 169 [2024-11-28 02:34:49,675 INFO L349 Elim1Store]: treesize reduction 79, result has 21.0 percent of original size [2024-11-28 02:34:49,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2024-11-28 02:34:49,720 INFO L349 Elim1Store]: treesize reduction 57, result has 35.2 percent of original size [2024-11-28 02:34:49,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 35 [2024-11-28 02:34:49,742 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 137 treesize of output 117 [2024-11-28 02:34:50,135 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 270 treesize of output 210 [2024-11-28 02:34:50,144 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 214 treesize of output 158 [2024-11-28 02:34:51,814 INFO L349 Elim1Store]: treesize reduction 32, result has 93.7 percent of original size [2024-11-28 02:34:51,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 54 case distinctions, treesize of input 271 treesize of output 661 [2024-11-28 02:34:52,357 INFO L349 Elim1Store]: treesize reduction 208, result has 51.5 percent of original size [2024-11-28 02:34:52,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 3 disjoint index pairs (out of 78 index pairs), introduced 16 new quantified variables, introduced 74 case distinctions, treesize of input 619 treesize of output 590 [2024-11-28 02:36:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:36:48,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:36:48,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|))) (.cse8 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (and (forall ((v_ArrVal_1478 (Array Int Int))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1476 Int) (v_ArrVal_1474 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse6 .cse7 v_ArrVal_1476)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1474))) (let ((.cse0 (select (select .cse2 .cse4) .cse5)) (.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1477) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= (select (select .cse2 .cse0) (+ .cse1 4)) 0))))) (not (= v_ArrVal_1478 (store .cse8 .cse7 (select v_ArrVal_1478 .cse7)))))) (forall ((v_ArrVal_1478 (Array Int Int))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1476 Int) (v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1475))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse6 .cse7 v_ArrVal_1476)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1474) .cse4) .cse5)) (.cse11 (select (select .cse9 .cse4) .cse5))) (or (= 0 (select (select .cse9 .cse10) (+ .cse11 4))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1477) .cse10) .cse11) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= v_ArrVal_1478 (store .cse8 .cse7 (select v_ArrVal_1478 .cse7))))))))) is different from false [2024-11-28 02:37:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868305929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:21,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:37:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 58 [2024-11-28 02:37:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32634739] [2024-11-28 02:37:21,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:37:21,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 02:37:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:21,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 02:37:21,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=4334, Unknown=7, NotChecked=132, Total=4692 [2024-11-28 02:37:21,573 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 58 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:37:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:37:43,827 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2024-11-28 02:37:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-28 02:37:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2024-11-28 02:37:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:37:43,829 INFO L225 Difference]: With dead ends: 142 [2024-11-28 02:37:43,829 INFO L226 Difference]: Without dead ends: 115 [2024-11-28 02:37:43,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=556, Invalid=9947, Unknown=7, NotChecked=202, Total=10712 [2024-11-28 02:37:43,833 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 118 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:37:43,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 531 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-28 02:37:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-28 02:37:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2024-11-28 02:37:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 72 states have internal predecessors, (80), 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) [2024-11-28 02:37:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-28 02:37:43,858 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 50 [2024-11-28 02:37:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:37:43,858 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-28 02:37:43,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:37:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-28 02:37:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 02:37:43,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:37:43,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:37:43,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:37:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:37:44,062 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:37:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:37:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -898724987, now seen corresponding path program 1 times [2024-11-28 02:37:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:37:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557104359] [2024-11-28 02:37:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:37:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:37:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:37:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557104359] [2024-11-28 02:37:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557104359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255533279] [2024-11-28 02:37:49,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:37:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:37:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:37:49,844 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:37:49,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:37:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:37:50,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-28 02:37:50,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:37:50,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:37:51,772 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from false [2024-11-28 02:37:51,779 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from true [2024-11-28 02:37:51,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:37:51,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:37:51,900 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from false [2024-11-28 02:37:51,910 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from true [2024-11-28 02:37:52,015 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 02:37:52,015 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 42 treesize of output 39 [2024-11-28 02:37:52,105 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-28 02:37:52,105 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 24 treesize of output 19 [2024-11-28 02:37:52,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-28 02:37:52,151 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-28 02:37:52,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2024-11-28 02:37:52,236 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-11-28 02:37:52,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from false [2024-11-28 02:37:52,390 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from true [2024-11-28 02:37:52,491 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse1)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-28 02:37:52,498 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse1)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-28 02:37:52,518 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 41 treesize of output 25 [2024-11-28 02:37:52,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-28 02:37:52,613 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from false [2024-11-28 02:37:52,620 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from true [2024-11-28 02:37:52,723 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from false [2024-11-28 02:37:52,730 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from true [2024-11-28 02:37:52,924 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-28 02:37:52,932 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-28 02:37:53,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:37:53,059 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 49 treesize of output 38 [2024-11-28 02:37:53,174 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 02:37:53,174 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 1 case distinctions, treesize of input 36 treesize of output 39 [2024-11-28 02:37:53,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= .cse2 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-28 02:37:53,341 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= .cse2 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-28 02:37:53,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1)))))) is different from false [2024-11-28 02:37:53,555 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 1)))))) is different from true [2024-11-28 02:37:53,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1)))))) is different from false [2024-11-28 02:37:53,770 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse3 .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1)))))) is different from true [2024-11-28 02:37:54,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse0 .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1)))))) is different from false [2024-11-28 02:37:54,350 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse0 .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1)))))) is different from true [2024-11-28 02:37:54,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse0 .cse4)) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1)))))) is different from false [2024-11-28 02:37:54,581 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse0 .cse4)) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1)))))) is different from true [2024-11-28 02:37:54,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse0 .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1)))))) is different from false [2024-11-28 02:37:54,813 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse3 0) (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse0 .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 1)))))) is different from true [2024-11-28 02:37:54,954 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-11-28 02:37:54,954 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 114 [2024-11-28 02:37:55,063 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-28 02:37:55,064 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 286 treesize of output 207 [2024-11-28 02:37:55,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:37:55,083 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 0 case distinctions, treesize of input 221 treesize of output 148 [2024-11-28 02:37:55,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:37:55,196 INFO L349 Elim1Store]: treesize reduction 100, result has 18.7 percent of original size [2024-11-28 02:37:55,196 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 187 treesize of output 159 [2024-11-28 02:37:55,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse4 (+ .cse5 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse0 .cse3) (= .cse2 .cse0)) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= .cse3 0))))))) is different from false [2024-11-28 02:37:55,319 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse4 (+ .cse5 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse0 .cse3) (= .cse2 .cse0)) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= .cse3 0))))))) is different from true [2024-11-28 02:37:55,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:37:55,381 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 191 treesize of output 127 [2024-11-28 02:37:55,465 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:37:55,466 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 [2024-11-28 02:37:55,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (+ .cse3 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (not (= 0 .cse2)) (or (= .cse3 0) (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1))))))) is different from false [2024-11-28 02:37:55,531 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (+ .cse3 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (not (= 0 .cse2)) (or (= .cse3 0) (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1))))))) is different from true [2024-11-28 02:37:55,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:37:55,963 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 0 case distinctions, treesize of input 94 treesize of output 65 [2024-11-28 02:37:56,115 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (not (= .cse0 0)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1)))))) is different from false [2024-11-28 02:37:56,122 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (not (= .cse0 0)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1)))))) is different from true [2024-11-28 02:37:56,144 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:37:56,145 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 46 treesize of output 21 [2024-11-28 02:37:56,231 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_24 Int)) (and (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_24) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_#t~mem15#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1))) (not (= |c_ULTIMATE.start_main_#t~mem15#1.base| 0))) is different from false [2024-11-28 02:37:56,241 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_24 Int)) (and (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_24) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_#t~mem15#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1))) (not (= |c_ULTIMATE.start_main_#t~mem15#1.base| 0))) is different from true [2024-11-28 02:37:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-28 02:37:56,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:37:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255533279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:37:59,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:37:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 51 [2024-11-28 02:37:59,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48607145] [2024-11-28 02:37:59,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:37:59,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-28 02:37:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:37:59,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-28 02:37:59,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1691, Unknown=40, NotChecked=1900, Total=3782 [2024-11-28 02:37:59,775 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 51 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 42 states have internal predecessors, (76), 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) [2024-11-28 02:38:01,094 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2024-11-28 02:38:01,101 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2024-11-28 02:38:01,109 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-28 02:38:01,116 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-28 02:38:01,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (not .cse0) .cse1))) is different from false [2024-11-28 02:38:01,131 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (not .cse0) .cse1))) is different from true [2024-11-28 02:38:01,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (or .cse2 .cse3) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-28 02:38:01,148 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (or .cse2 .cse3) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-28 02:38:01,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse2) 1)))) is different from false [2024-11-28 02:38:01,167 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse2) 1)))) is different from true [2024-11-28 02:38:01,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |c_#valid| .cse4)))))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-28 02:38:01,184 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |c_#valid| .cse4)))))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-28 02:38:01,194 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from false [2024-11-28 02:38:01,201 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))))) is different from true [2024-11-28 02:38:01,216 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse1)) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))))) is different from false [2024-11-28 02:38:01,225 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse1)) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_177) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))))) is different from true [2024-11-28 02:38:01,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) (= .cse5 .cse3)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-28 02:38:01,249 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_23| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) (= .cse5 .cse3)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-28 02:38:01,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse6 .cse5)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse5) 1)))))) is different from false [2024-11-28 02:38:01,279 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse6 .cse5)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse5) 1)))))) is different from true [2024-11-28 02:38:01,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse6 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1))))))) is different from false [2024-11-28 02:38:01,308 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse6 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1))))))) is different from true [2024-11-28 02:38:01,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse6 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1))))))) is different from false [2024-11-28 02:38:01,338 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse6 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1))))))) is different from true [2024-11-28 02:38:01,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse2 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1))))))) is different from false [2024-11-28 02:38:01,363 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse2 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1))))))) is different from true [2024-11-28 02:38:01,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse2 .cse6)) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1))))))) is different from false [2024-11-28 02:38:01,394 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse2 .cse6)) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1))))))) is different from true [2024-11-28 02:38:01,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse2 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1))))))) is different from false [2024-11-28 02:38:01,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4)) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (or (= .cse5 0) (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= .cse2 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_23| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse6) 1))))))) is different from true [2024-11-28 02:38:01,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse10 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse5)) (.cse6 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) 4) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse7 0) (= .cse1 .cse4) (= .cse3 .cse1)) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse9 (select |v_#valid_BEFORE_CALL_23| .cse9))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse8) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0))))))) is different from false [2024-11-28 02:38:01,447 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse10 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse5 (+ .cse7 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse5)) (.cse6 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) 4) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse7 0) (= .cse1 .cse4) (= .cse3 .cse1)) (exists ((v_arrayElimCell_177 Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_177) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse9 (select |v_#valid_BEFORE_CALL_23| .cse9))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse8) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0))))))) is different from true [2024-11-28 02:38:01,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ .cse6 4))) (let ((.cse1 (= .cse6 0)) (.cse4 (select .cse0 .cse3))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) .cse1 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (not (= 0 .cse4)) (or .cse1 (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))))))) is different from false [2024-11-28 02:38:01,464 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ .cse6 4))) (let ((.cse1 (= .cse6 0)) (.cse4 (select .cse0 .cse3))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) .cse1 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (not (= 0 .cse4)) (or .cse1 (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_23| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_23| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))))))) is different from true [2024-11-28 02:38:01,474 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (not (= .cse0 0)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1)))))) is different from false [2024-11-28 02:38:01,481 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse0) 0) (not (= .cse0 0)) (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1)))))) is different from true [2024-11-28 02:38:01,491 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_24 Int)) (and (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_24) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_#t~mem15#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1))) (not (= |c_ULTIMATE.start_main_#t~mem15#1.base| 0))) is different from false [2024-11-28 02:38:01,498 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_19| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimIndex_24 Int)) (and (= |v_old(#valid)_AFTER_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_24) 1) (= (select |v_old(#valid)_AFTER_CALL_23| |c_ULTIMATE.start_main_#t~mem15#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_23| |v_ULTIMATE.start_main_~ptr~0#1.base_19|) 1))) (not (= |c_ULTIMATE.start_main_#t~mem15#1.base| 0))) is different from true [2024-11-28 02:38:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:06,099 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2024-11-28 02:38:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-28 02:38:06,100 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 42 states have internal predecessors, (76), 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 50 [2024-11-28 02:38:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:38:06,101 INFO L225 Difference]: With dead ends: 134 [2024-11-28 02:38:06,101 INFO L226 Difference]: Without dead ends: 129 [2024-11-28 02:38:06,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=252, Invalid=2578, Unknown=78, NotChecked=5282, Total=8190 [2024-11-28 02:38:06,104 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3137 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:38:06,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 901 Invalid, 4188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1044 Invalid, 0 Unknown, 3137 Unchecked, 4.0s Time] [2024-11-28 02:38:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-28 02:38:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-11-28 02:38:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.1063829787234043) internal successors, (104), 94 states have internal predecessors, (104), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 02:38:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-28 02:38:06,131 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 50 [2024-11-28 02:38:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:38:06,132 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-28 02:38:06,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 42 states have internal predecessors, (76), 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) [2024-11-28 02:38:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-28 02:38:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 02:38:06,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:38:06,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:06,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:38:06,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 02:38:06,334 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:38:06,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash -682032385, now seen corresponding path program 2 times [2024-11-28 02:38:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:38:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86430939] [2024-11-28 02:38:06,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:38:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:06,393 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:38:06,393 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:38:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:38:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:38:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86430939] [2024-11-28 02:38:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86430939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569511998] [2024-11-28 02:38:14,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:38:14,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:14,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:14,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:38:14,297 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:38:14,297 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:38:14,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 157 conjuncts are in the unsatisfiable core [2024-11-28 02:38:14,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:14,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:38:15,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:38:15,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:38:16,761 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:38:16,761 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 02:38:16,849 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:38:16,849 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 02:38:16,959 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:38:16,959 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:38:17,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2024-11-28 02:38:17,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:38:17,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:17,333 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 17 treesize of output 19 [2024-11-28 02:38:17,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-28 02:38:17,678 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:38:17,678 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 1 case distinctions, treesize of input 78 treesize of output 55 [2024-11-28 02:38:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:17,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-28 02:38:19,317 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:38:19,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 45 [2024-11-28 02:38:19,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-28 02:38:19,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:38:20,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:20,595 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-11-28 02:38:20,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 69 [2024-11-28 02:38:20,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:20,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:20,663 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-28 02:38:20,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-11-28 02:38:20,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:20,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:20,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2024-11-28 02:38:24,073 INFO L349 Elim1Store]: treesize reduction 296, result has 28.5 percent of original size [2024-11-28 02:38:24,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 172 treesize of output 159 [2024-11-28 02:38:24,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:24,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:38:24,426 INFO L349 Elim1Store]: treesize reduction 358, result has 18.6 percent of original size [2024-11-28 02:38:24,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 97 [2024-11-28 02:38:26,475 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 616 treesize of output 536 [2024-11-28 02:38:37,725 INFO L349 Elim1Store]: treesize reduction 70, result has 21.3 percent of original size [2024-11-28 02:38:37,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 113 treesize of output 72 [2024-11-28 02:38:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:38:38,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:40:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569511998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:40:49,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:40:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 63 [2024-11-28 02:40:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019847673] [2024-11-28 02:40:49,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:40:49,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 02:40:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:40:49,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 02:40:49,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5169, Unknown=8, NotChecked=0, Total=5402 [2024-11-28 02:40:49,024 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 63 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 53 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:42:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:42:51,488 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2024-11-28 02:42:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-28 02:42:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 53 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2024-11-28 02:42:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:42:51,490 INFO L225 Difference]: With dead ends: 143 [2024-11-28 02:42:51,490 INFO L226 Difference]: Without dead ends: 134 [2024-11-28 02:42:51,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3436 ImplicationChecksByTransitivity, 253.5s TimeCoverageRelationStatistics Valid=660, Invalid=13612, Unknown=8, NotChecked=0, Total=14280 [2024-11-28 02:42:51,494 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 144 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:42:51,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 638 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2024-11-28 02:42:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-28 02:42:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2024-11-28 02:42:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 96 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 02:42:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-11-28 02:42:51,618 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 54 [2024-11-28 02:42:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:42:51,619 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-11-28 02:42:51,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 53 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 02:42:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-11-28 02:42:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 02:42:51,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:42:51,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:42:51,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:42:51,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 02:42:51,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:42:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:42:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -681963875, now seen corresponding path program 2 times [2024-11-28 02:42:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:42:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41100692] [2024-11-28 02:42:51,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:42:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:42:51,934 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:42:51,934 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:43:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:43:03,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:43:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41100692] [2024-11-28 02:43:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41100692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:43:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647591822] [2024-11-28 02:43:03,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:43:03,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:43:03,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:43:03,903 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:43:03,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01c995bc-ab1d-497e-af0a-301388673f7d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:43:04,213 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:43:04,213 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:43:04,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-28 02:43:04,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:43:04,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:43:05,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:43:05,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:43:07,893 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 02:43:07,893 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 02:43:08,051 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 02:43:08,051 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 02:43:08,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:43:08,636 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 17 treesize of output 19 [2024-11-28 02:43:08,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-28 02:43:08,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2024-11-28 02:43:08,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 02:43:09,296 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:43:09,296 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 1 case distinctions, treesize of input 78 treesize of output 55 [2024-11-28 02:43:09,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:09,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-28 02:43:11,947 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 02:43:11,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 45 [2024-11-28 02:43:11,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 02:43:11,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-28 02:43:13,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:43:13,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:13,765 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:43:13,765 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 98 treesize of output 65 [2024-11-28 02:43:13,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:13,909 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 02:43:13,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 02:43:13,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-11-28 02:43:18,429 INFO L349 Elim1Store]: treesize reduction 108, result has 33.3 percent of original size [2024-11-28 02:43:18,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 116 treesize of output 109 [2024-11-28 02:43:18,677 INFO L349 Elim1Store]: treesize reduction 100, result has 19.4 percent of original size [2024-11-28 02:43:18,678 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 6 case distinctions, treesize of input 267 treesize of output 215 [2024-11-28 02:43:18,926 INFO L349 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2024-11-28 02:43:18,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 117 [2024-11-28 02:43:18,974 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 34 [2024-11-28 02:43:19,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:19,242 INFO L349 Elim1Store]: treesize reduction 132, result has 24.1 percent of original size [2024-11-28 02:43:19,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 76 [2024-11-28 02:43:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:19,412 INFO L349 Elim1Store]: treesize reduction 49, result has 21.0 percent of original size [2024-11-28 02:43:19,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 58 [2024-11-28 02:43:19,510 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 7 treesize of output 3 [2024-11-28 02:43:19,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:43:19,577 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 1 [2024-11-28 02:43:19,700 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 52 treesize of output 19 [2024-11-28 02:43:19,715 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 15 [2024-11-28 02:43:19,773 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 36 treesize of output 24 [2024-11-28 02:43:21,130 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 344 treesize of output 264 [2024-11-28 02:43:26,916 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:43:26,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 73 [2024-11-28 02:43:26,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:43:27,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:43:27,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-28 02:43:27,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 02:43:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:43:27,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:43:30,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse17 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse17 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2115 (Array Int Int))) (let ((.cse3 (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2108)) (.cse6 (store .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2115))) (let ((.cse4 (select (select .cse6 .cse7) .cse8)) (.cse5 (+ (select (select .cse3 .cse7) .cse8) 4))) (let ((.cse0 (select (select .cse6 .cse4) .cse5))) (or (= .cse0 0) (= (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2116))) (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse2 v_ArrVal_2111))) .cse0) (select (select .cse3 .cse4) .cse5)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2115 (Array Int Int))) (let ((.cse16 (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2108)) (.cse13 (store .cse9 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2115))) (let ((.cse14 (select (select .cse13 .cse7) .cse8)) (.cse15 (+ (select (select .cse16 .cse7) .cse8) 4))) (let ((.cse11 (select (select .cse16 .cse14) .cse15))) (or (= .cse11 0) (= (select (select (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2116))) (store .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse2 v_ArrVal_2111))) (select (select .cse13 .cse14) .cse15)) .cse11) |c_ULTIMATE.start_main_~uneq~0#1|))))))))) is different from false [2024-11-28 02:43:39,750 INFO L349 Elim1Store]: treesize reduction 686, result has 60.3 percent of original size [2024-11-28 02:43:39,750 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 4 case distinctions, treesize of input 3329 treesize of output 3817 [2024-11-28 02:43:40,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:43:40,059 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 2890 treesize of output 3064 [2024-11-28 02:43:40,118 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 2529 treesize of output 2277 [2024-11-28 02:43:40,187 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 2625 treesize of output 2373 [2024-11-28 02:43:54,061 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 88 treesize of output 4 [2024-11-28 02:45:41,496 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 172 treesize of output 88 [2024-11-28 02:45:41,842 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2024-11-28 02:45:41,842 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 163 treesize of output 4 [2024-11-28 02:45:41,949 INFO L349 Elim1Store]: treesize reduction 171, result has 0.6 percent of original size [2024-11-28 02:45:41,950 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 260 treesize of output 8 [2024-11-28 02:45:42,027 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 02:45:42,364 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 172 treesize of output 88 [2024-11-28 02:45:43,106 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 87 treesize of output 3 [2024-11-28 02:45:43,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 3 [2024-11-28 02:45:43,560 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 172 treesize of output 88 [2024-11-28 02:45:43,863 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2024-11-28 02:45:43,863 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 1 case distinctions, treesize of input 163 treesize of output 4 [2024-11-28 02:45:45,089 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 87 treesize of output 3 [2024-11-28 02:45:45,336 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 260 treesize of output 92 [2024-11-28 02:45:51,154 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 172 treesize of output 88 [2024-11-28 02:45:51,372 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 172 treesize of output 88 [2024-11-28 02:45:51,878 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 260 treesize of output 92 [2024-11-28 02:45:52,221 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 87 treesize of output 3 [2024-11-28 02:45:52,511 INFO L349 Elim1Store]: treesize reduction 171, result has 0.6 percent of original size [2024-11-28 02:45:52,511 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 1 case distinctions, treesize of input 260 treesize of output 8