./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:13:54,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:13:54,845 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:13:54,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:13:54,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:13:54,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:13:54,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:13:54,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:13:54,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:13:54,879 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:13:54,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:13:54,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:13:54,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:13:54,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:13:54,882 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:13:54,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:13:54,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:13:54,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:13:54,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:13:54,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:13:54,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:13:54,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:13:54,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:13:54,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:13:54,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:13:54,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:13:54,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:13:54,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:13:54,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:13:54,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:13:54,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:13:54,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:13:54,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:13:54,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:13:54,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:13:54,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:13:54,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:13:54,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:13:54,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:13:54,903 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:13:54,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:13:54,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:13:54,904 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2023-11-29 01:13:55,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:13:55,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:13:55,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:13:55,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:13:55,144 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:13:55,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-11-29 01:13:57,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:13:58,103 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:13:58,103 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-11-29 01:13:58,115 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/data/a6498bffd/11e05d38abca47f5a4016751f4db8eef/FLAG12f24bfae [2023-11-29 01:13:58,126 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/data/a6498bffd/11e05d38abca47f5a4016751f4db8eef [2023-11-29 01:13:58,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:13:58,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:13:58,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:13:58,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:13:58,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:13:58,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4faaf5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58, skipping insertion in model container [2023-11-29 01:13:58,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,177 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:13:58,424 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2023-11-29 01:13:58,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:13:58,439 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:13:58,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2023-11-29 01:13:58,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:13:58,510 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:13:58,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58 WrapperNode [2023-11-29 01:13:58,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:13:58,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:13:58,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:13:58,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:13:58,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,555 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2023-11-29 01:13:58,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:13:58,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:13:58,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:13:58,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:13:58,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,591 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 6, 13]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2023-11-29 01:13:58,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:13:58,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:13:58,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:13:58,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:13:58,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (1/1) ... [2023-11-29 01:13:58,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:13:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:13:58,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:13:58,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:13:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:13:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:13:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:13:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:13:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:13:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:13:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 01:13:58,688 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 01:13:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:13:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:13:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:13:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:13:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:13:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:13:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:13:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:13:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:13:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:13:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:13:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:13:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:13:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:13:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:13:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:13:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:13:58,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:13:58,827 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:13:58,829 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:13:59,005 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:13:59,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:13:59,038 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:13:59,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:13:59 BoogieIcfgContainer [2023-11-29 01:13:59,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:13:59,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:13:59,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:13:59,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:13:59,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:13:58" (1/3) ... [2023-11-29 01:13:59,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3461a6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:13:59, skipping insertion in model container [2023-11-29 01:13:59,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:13:58" (2/3) ... [2023-11-29 01:13:59,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3461a6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:13:59, skipping insertion in model container [2023-11-29 01:13:59,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:13:59" (3/3) ... [2023-11-29 01:13:59,048 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-11-29 01:13:59,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:13:59,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:13:59,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:13:59,123 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c27c535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:13:59,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:13:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 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) [2023-11-29 01:13:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:13:59,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:59,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:13:59,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:13:59,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1765087503, now seen corresponding path program 1 times [2023-11-29 01:13:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:13:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156130669] [2023-11-29 01:13:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:13:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:13:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:13:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:13:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156130669] [2023-11-29 01:13:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156130669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:13:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:13:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:13:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345527544] [2023-11-29 01:13:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:13:59,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:13:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:13:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:13:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:13:59,478 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:13:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:59,546 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2023-11-29 01:13:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:13:59,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2023-11-29 01:13:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:59,555 INFO L225 Difference]: With dead ends: 48 [2023-11-29 01:13:59,556 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 01:13:59,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:13:59,562 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:59,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:13:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 01:13:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 01:13:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:13:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-29 01:13:59,599 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2023-11-29 01:13:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:59,600 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-29 01:13:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:13:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-29 01:13:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:13:59,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:59,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:13:59,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:13:59,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:13:59,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:59,604 INFO L85 PathProgramCache]: Analyzing trace with hash 851795797, now seen corresponding path program 1 times [2023-11-29 01:13:59,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:13:59,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5598188] [2023-11-29 01:13:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:13:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:13:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:13:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:13:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5598188] [2023-11-29 01:13:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5598188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:13:59,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:13:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:13:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522698870] [2023-11-29 01:13:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:13:59,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:13:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:13:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:13:59,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:13:59,784 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-11-29 01:13:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:59,844 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2023-11-29 01:13:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:13:59,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2023-11-29 01:13:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:59,846 INFO L225 Difference]: With dead ends: 43 [2023-11-29 01:13:59,846 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 01:13:59,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:13:59,848 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:59,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:13:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 01:13:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-11-29 01:13:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:13:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-29 01:13:59,857 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2023-11-29 01:13:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:59,857 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-29 01:13:59,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-11-29 01:13:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-29 01:13:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:13:59,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:59,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:13:59,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:13:59,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:13:59,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -853542195, now seen corresponding path program 1 times [2023-11-29 01:13:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:13:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792269541] [2023-11-29 01:13:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:13:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:59,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:13:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 01:14:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792269541] [2023-11-29 01:14:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792269541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:14:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:14:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:14:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687288313] [2023-11-29 01:14:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:14:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:14:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:14:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:14:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:14:00,038 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:14:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:00,095 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-11-29 01:14:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:14:00,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2023-11-29 01:14:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:00,097 INFO L225 Difference]: With dead ends: 48 [2023-11-29 01:14:00,097 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 01:14:00,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:14:00,099 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:00,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:14:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 01:14:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-29 01:14:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:14:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-11-29 01:14:00,106 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2023-11-29 01:14:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:00,107 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-29 01:14:00,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:14:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-11-29 01:14:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 01:14:00,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:00,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:14:00,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:14:00,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659445, now seen corresponding path program 1 times [2023-11-29 01:14:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:14:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531192775] [2023-11-29 01:14:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:14:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:00,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:14:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:00,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 01:14:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531192775] [2023-11-29 01:14:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531192775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456885606] [2023-11-29 01:14:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:00,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:00,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:14:00,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:14:00,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:14:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:00,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:14:00,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:14:00,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456885606] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:14:00,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:14:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-29 01:14:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919103224] [2023-11-29 01:14:00,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:14:00,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:14:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:14:00,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:14:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:14:00,525 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:14:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:00,592 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-11-29 01:14:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:14:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-11-29 01:14:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:00,593 INFO L225 Difference]: With dead ends: 44 [2023-11-29 01:14:00,594 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 01:14:00,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:14:00,595 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:00,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:14:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 01:14:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 01:14:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:14:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-29 01:14:00,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2023-11-29 01:14:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:00,603 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-29 01:14:00,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:14:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-11-29 01:14:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 01:14:00,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:00,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:00,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:14:00,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:00,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:14:00,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178627, now seen corresponding path program 1 times [2023-11-29 01:14:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:14:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565442408] [2023-11-29 01:14:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:14:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:14:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:14:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:14:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:14:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565442408] [2023-11-29 01:14:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565442408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875316840] [2023-11-29 01:14:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:14:01,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:14:01,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:14:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:01,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 01:14:01,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:01,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 01:14:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:01,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:01,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 01:14:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:14:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875316840] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:14:01,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:14:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-29 01:14:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697369067] [2023-11-29 01:14:01,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:14:01,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 01:14:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:14:01,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:14:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:14:01,773 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:14:05,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:09,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:13,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:17,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:21,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:25,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:26,154 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-11-29 01:14:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:14:26,155 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 29 [2023-11-29 01:14:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:26,156 INFO L225 Difference]: With dead ends: 52 [2023-11-29 01:14:26,156 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 01:14:26,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-11-29 01:14:26,158 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:26,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 207 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2023-11-29 01:14:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 01:14:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 01:14:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:14:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-29 01:14:26,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-11-29 01:14:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:26,166 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-29 01:14:26,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:14:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-29 01:14:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:14:26,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:26,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:26,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:14:26,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:26,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:14:26,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2018592169, now seen corresponding path program 1 times [2023-11-29 01:14:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:14:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064852970] [2023-11-29 01:14:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:14:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:14:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:14:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:14:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:14:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:26,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064852970] [2023-11-29 01:14:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064852970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391230573] [2023-11-29 01:14:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:26,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:26,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:14:26,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:14:26,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:14:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:26,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 01:14:26,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:26,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 01:14:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:26,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:14:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391230573] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:14:26,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:14:26,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2023-11-29 01:14:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794886053] [2023-11-29 01:14:26,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:14:26,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:14:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:14:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:14:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:14:26,984 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:14:30,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:34,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:39,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:43,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:47,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:51,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:14:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:51,206 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-29 01:14:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:14:51,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-11-29 01:14:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:51,207 INFO L225 Difference]: With dead ends: 38 [2023-11-29 01:14:51,207 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 01:14:51,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:14:51,209 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:51,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 130 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2023-11-29 01:14:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 01:14:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-29 01:14:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:14:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-29 01:14:51,216 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2023-11-29 01:14:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:51,217 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 01:14:51,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:14:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-29 01:14:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:14:51,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:51,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:51,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:14:51,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 01:14:51,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:14:51,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2018590495, now seen corresponding path program 1 times [2023-11-29 01:14:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:14:51,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764232615] [2023-11-29 01:14:51,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:51,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:14:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:14:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:14:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:14:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:14:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764232615] [2023-11-29 01:14:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764232615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299260222] [2023-11-29 01:14:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:52,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:52,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:14:52,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:14:52,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:14:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-29 01:14:53,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:53,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:14:53,791 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:14:53,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:14:53,878 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 [2023-11-29 01:14:53,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:14:54,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:14:54,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:14:54,442 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 01:14:54,443 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 [2023-11-29 01:14:54,458 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 [2023-11-29 01:14:54,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:14:54,753 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 01:14:54,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 01:14:54,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:14:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:14:54,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299260222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:06,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:15:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2023-11-29 01:15:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92062282] [2023-11-29 01:15:06,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:06,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 01:15:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 01:15:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2171, Unknown=22, NotChecked=0, Total=2352 [2023-11-29 01:15:06,291 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:15:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:07,636 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-11-29 01:15:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 01:15:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 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 32 [2023-11-29 01:15:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:07,638 INFO L225 Difference]: With dead ends: 49 [2023-11-29 01:15:07,638 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 01:15:07,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=296, Invalid=3588, Unknown=22, NotChecked=0, Total=3906 [2023-11-29 01:15:07,641 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:07,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 251 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:15:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 01:15:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2023-11-29 01:15:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:15:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-11-29 01:15:07,650 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2023-11-29 01:15:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:07,650 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-29 01:15:07,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:15:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-11-29 01:15:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:15:07,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:07,652 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:15:07,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:15:07,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 01:15:07,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:07,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1459785074, now seen corresponding path program 1 times [2023-11-29 01:15:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:07,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073301987] [2023-11-29 01:15:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:15:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:15:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:15:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:15:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073301987] [2023-11-29 01:15:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073301987] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659976435] [2023-11-29 01:15:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:08,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:08,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:15:08,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:15:08,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:15:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:09,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 01:15:09,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:09,174 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 [2023-11-29 01:15:09,312 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:15:09,313 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 [2023-11-29 01:15:09,365 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 [2023-11-29 01:15:09,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:09,425 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 [2023-11-29 01:15:09,620 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 [2023-11-29 01:15:09,626 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 [2023-11-29 01:15:09,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:15:09,714 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 [2023-11-29 01:15:09,734 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 01:15:09,735 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 [2023-11-29 01:15:10,061 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2023-11-29 01:15:10,061 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 54 [2023-11-29 01:15:10,089 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-29 01:15:10,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2023-11-29 01:15:10,100 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 35 treesize of output 27 [2023-11-29 01:15:10,151 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 48 treesize of output 32 [2023-11-29 01:15:10,154 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 36 treesize of output 24 [2023-11-29 01:15:10,211 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 [2023-11-29 01:15:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:15:10,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:10,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659976435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:10,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:15:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 37 [2023-11-29 01:15:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902218360] [2023-11-29 01:15:10,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:10,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 01:15:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 01:15:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1767, Unknown=1, NotChecked=0, Total=1892 [2023-11-29 01:15:10,889 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 37 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 01:15:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:12,400 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-11-29 01:15:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:15:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2023-11-29 01:15:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:12,401 INFO L225 Difference]: With dead ends: 54 [2023-11-29 01:15:12,401 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 01:15:12,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=287, Invalid=3252, Unknown=1, NotChecked=0, Total=3540 [2023-11-29 01:15:12,403 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:12,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 320 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:15:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 01:15:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2023-11-29 01:15:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:15:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-29 01:15:12,412 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2023-11-29 01:15:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:12,412 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-29 01:15:12,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 01:15:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-29 01:15:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:15:12,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:12,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:15:12,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:15:12,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:12,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:12,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1013232572, now seen corresponding path program 1 times [2023-11-29 01:15:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341143539] [2023-11-29 01:15:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:15:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:15:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:15:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:15:14,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:14,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341143539] [2023-11-29 01:15:14,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341143539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95398249] [2023-11-29 01:15:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:14,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:14,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:15:14,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:15:14,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:15:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:14,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 01:15:14,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:15,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:15:15,325 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:15:15,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:15:15,395 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 13 treesize of output 9 [2023-11-29 01:15:15,403 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 22 treesize of output 7 [2023-11-29 01:15:15,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:15,478 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 62 treesize of output 57 [2023-11-29 01:15:15,487 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 28 treesize of output 11 [2023-11-29 01:15:15,746 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 14 [2023-11-29 01:15:15,750 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 15 treesize of output 3 [2023-11-29 01:15:15,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:15:15,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:15:15,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-29 01:15:15,874 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 01:15:15,874 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 34 treesize of output 36 [2023-11-29 01:15:15,892 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 24 treesize of output 19 [2023-11-29 01:15:16,172 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 58 treesize of output 16 [2023-11-29 01:15:16,289 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 [2023-11-29 01:15:16,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 01:15:16,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:15:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:15:16,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95398249] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:25,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:15:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2023-11-29 01:15:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836407930] [2023-11-29 01:15:25,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 01:15:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 01:15:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2324, Unknown=66, NotChecked=0, Total=2550 [2023-11-29 01:15:25,499 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 36 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:15:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:27,086 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-11-29 01:15:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:15:27,086 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 36 states have internal predecessors, (54), 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 34 [2023-11-29 01:15:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:27,087 INFO L225 Difference]: With dead ends: 54 [2023-11-29 01:15:27,087 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 01:15:27,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=310, Invalid=3782, Unknown=68, NotChecked=0, Total=4160 [2023-11-29 01:15:27,090 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:27,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 272 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:15:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 01:15:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2023-11-29 01:15:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:15:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-11-29 01:15:27,101 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2023-11-29 01:15:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:27,101 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-11-29 01:15:27,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 36 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:15:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-11-29 01:15:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 01:15:27,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:27,102 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:15:27,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:15:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:27,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:27,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1241039849, now seen corresponding path program 1 times [2023-11-29 01:15:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344845288] [2023-11-29 01:15:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:29,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:15:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:15:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:15:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:15:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344845288] [2023-11-29 01:15:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344845288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793469515] [2023-11-29 01:15:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:29,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:29,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:15:29,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:15:29,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:15:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:30,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 135 conjunts are in the unsatisfiable core [2023-11-29 01:15:30,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:30,533 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 [2023-11-29 01:15:30,718 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 [2023-11-29 01:15:31,093 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:15:31,093 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 [2023-11-29 01:15:31,104 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 [2023-11-29 01:15:31,214 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 [2023-11-29 01:15:31,220 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 13 treesize of output 9 [2023-11-29 01:15:31,231 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 [2023-11-29 01:15:31,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:31,337 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 118 treesize of output 103 [2023-11-29 01:15:31,345 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 [2023-11-29 01:15:31,352 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 30 treesize of output 13 [2023-11-29 01:15:31,670 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 81 treesize of output 25 [2023-11-29 01:15:31,674 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 17 treesize of output 3 [2023-11-29 01:15:31,679 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 [2023-11-29 01:15:31,684 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 [2023-11-29 01:15:31,871 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 01:15:31,871 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 [2023-11-29 01:15:36,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse5 (not (= .cse3 .cse6))) (.cse7 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6))) (.cse8 (not (= 0 .cse6)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse0 (select |c_#memory_int#2| .cse0))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse1) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (not (= .cse1 .cse3)) (not (= .cse1 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)))) (and .cse5 (= (select (select |c_#memory_int#2| .cse6) 0) 1) .cse7 .cse8) (and .cse5 .cse7 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse9 (select |c_#memory_int#2| .cse9))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse9)))) .cse8)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse4) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse10 (select |c_#memory_$Pointer$#2.offset| .cse10))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse10))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from false [2023-11-29 01:15:36,034 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse5 (not (= .cse3 .cse6))) (.cse7 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6))) (.cse8 (not (= 0 .cse6)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse0 (select |c_#memory_int#2| .cse0))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse1) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (not (= .cse1 .cse3)) (not (= .cse1 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)))) (and .cse5 (= (select (select |c_#memory_int#2| .cse6) 0) 1) .cse7 .cse8) (and .cse5 .cse7 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse9 (select |c_#memory_int#2| .cse9))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse9)))) .cse8)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse4) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse10 (select |c_#memory_$Pointer$#2.offset| .cse10))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse10))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from true [2023-11-29 01:15:36,887 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2023-11-29 01:15:36,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 100 [2023-11-29 01:15:36,918 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-11-29 01:15:36,918 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 348 treesize of output 199 [2023-11-29 01:15:36,928 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2023-11-29 01:15:36,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:15:36,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2023-11-29 01:15:36,942 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 70 treesize of output 25 [2023-11-29 01:15:36,949 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 66 treesize of output 21 [2023-11-29 01:15:37,108 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 152 treesize of output 112 [2023-11-29 01:15:37,112 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 116 treesize of output 84 [2023-11-29 01:15:37,290 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 01:15:37,290 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 81 treesize of output 30 [2023-11-29 01:15:37,298 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 9 treesize of output 3 [2023-11-29 01:15:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:15:37,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:39,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_30| Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| Int) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1730 Int) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1742)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse8 .cse3) .cse4))) (let ((.cse0 (select .cse8 .cse5)) (.cse2 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1741)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_30| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36|) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_30| (select (select .cse2 .cse3) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#2| .cse5 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1740) .cse5) .cse1 v_ArrVal_1730)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1725) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1729) .cse6) .cse7)) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse5 (store (select .cse2 .cse5) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1728) .cse6) .cse7))))))))) is different from false [2023-11-29 01:15:39,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793469515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:39,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:15:39,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 52 [2023-11-29 01:15:39,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031209772] [2023-11-29 01:15:39,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:39,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 01:15:39,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:39,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 01:15:39,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3204, Unknown=41, NotChecked=230, Total=3660 [2023-11-29 01:15:39,281 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:15:44,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:15:45,818 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ (select .cse15 0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse8))) (let ((.cse1 (= (select (select |c_#memory_int#2| .cse11) 0) 1)) (.cse0 (not (= .cse3 .cse11))) (.cse10 (not (= 0 .cse11))) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse8) 0))) (and .cse0 (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 .cse2 (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse9 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse11)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse5 (select |c_#memory_int#2| .cse5))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse8)) (.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7) (not (= .cse6 .cse3)) (not (= .cse6 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5)))) (and .cse0 .cse1 .cse9 .cse10) (and .cse0 .cse9 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse11) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse12 (select |c_#memory_int#2| .cse12))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)))) .cse10))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (= (select |c_#valid| .cse13) 1) (not (= .cse4 .cse13)) .cse10 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse13) 0)) (= (select |c_#valid| .cse11) 1) (or .cse2 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse8) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse14 (select |c_#memory_$Pointer$#2.offset| .cse14))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2023-11-29 01:15:45,825 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ (select .cse15 0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse8))) (let ((.cse1 (= (select (select |c_#memory_int#2| .cse11) 0) 1)) (.cse0 (not (= .cse3 .cse11))) (.cse10 (not (= 0 .cse11))) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse8) 0))) (and .cse0 (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 .cse2 (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse9 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse11)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse5 (select |c_#memory_int#2| .cse5))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse8)) (.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7) (not (= .cse6 .cse3)) (not (= .cse6 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5)))) (and .cse0 .cse1 .cse9 .cse10) (and .cse0 .cse9 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse11) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse12 (select |c_#memory_int#2| .cse12))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)))) .cse10))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (= (select |c_#valid| .cse13) 1) (not (= .cse4 .cse13)) .cse10 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse13) 0)) (= (select |c_#valid| .cse11) 1) (or .cse2 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse8) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse14 (select |c_#memory_$Pointer$#2.offset| .cse14))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2023-11-29 01:16:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:00,068 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-11-29 01:16:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 01:16:00,068 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 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 36 [2023-11-29 01:16:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:00,069 INFO L225 Difference]: With dead ends: 55 [2023-11-29 01:16:00,069 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 01:16:00,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=416, Invalid=6027, Unknown=49, NotChecked=480, Total=6972 [2023-11-29 01:16:00,072 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:00,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 381 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1165 Invalid, 1 Unknown, 102 Unchecked, 5.3s Time] [2023-11-29 01:16:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 01:16:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2023-11-29 01:16:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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) [2023-11-29 01:16:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-11-29 01:16:00,082 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 36 [2023-11-29 01:16:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:00,082 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-11-29 01:16:00,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:16:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-11-29 01:16:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 01:16:00,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:00,083 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:00,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 01:16:00,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 01:16:00,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:00,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1687594025, now seen corresponding path program 2 times [2023-11-29 01:16:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909237979] [2023-11-29 01:16:00,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:16:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:02,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:16:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909237979] [2023-11-29 01:16:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909237979] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946764581] [2023-11-29 01:16:02,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:16:02,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:02,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:02,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:02,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:16:03,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:16:03,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:16:03,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-29 01:16:03,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:03,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:16:03,265 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 [2023-11-29 01:16:03,535 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:16:03,535 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 18 treesize of output 17 [2023-11-29 01:16:03,539 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 [2023-11-29 01:16:03,559 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:16:03,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:16:03,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:03,670 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 [2023-11-29 01:16:03,677 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 9 treesize of output 12 [2023-11-29 01:16:03,683 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 18 treesize of output 13 [2023-11-29 01:16:03,805 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:03,805 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 92 treesize of output 81 [2023-11-29 01:16:03,820 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-29 01:16:03,821 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 1 case distinctions, treesize of input 43 treesize of output 43 [2023-11-29 01:16:03,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:16:04,237 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 80 treesize of output 48 [2023-11-29 01:16:04,246 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:04,246 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 01:16:04,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:16:04,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 01:16:04,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:04,584 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 88 treesize of output 65 [2023-11-29 01:16:04,599 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:16:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 01:16:04,611 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 59 treesize of output 41 [2023-11-29 01:16:04,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 01:16:05,141 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 90 treesize of output 50 [2023-11-29 01:16:05,340 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:05,340 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 01:16:05,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:05,514 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 01:16:05,519 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 [2023-11-29 01:16:05,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:16:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:16:05,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946764581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:18,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-11-29 01:16:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781145091] [2023-11-29 01:16:18,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:18,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 01:16:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 01:16:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3146, Unknown=77, NotChecked=0, Total=3422 [2023-11-29 01:16:18,112 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 42 states have internal predecessors, (59), 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) [2023-11-29 01:16:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:21,493 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2023-11-29 01:16:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 01:16:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 42 states have internal predecessors, (59), 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 36 [2023-11-29 01:16:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:21,495 INFO L225 Difference]: With dead ends: 62 [2023-11-29 01:16:21,495 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 01:16:21,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=473, Invalid=6092, Unknown=77, NotChecked=0, Total=6642 [2023-11-29 01:16:21,497 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:21,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 251 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 01:16:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 01:16:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2023-11-29 01:16:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:16:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-11-29 01:16:21,511 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 36 [2023-11-29 01:16:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:21,512 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-11-29 01:16:21,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 42 states have internal predecessors, (59), 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) [2023-11-29 01:16:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-11-29 01:16:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 01:16:21,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:21,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:21,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:16:21,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 01:16:21,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:21,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1361646376, now seen corresponding path program 1 times [2023-11-29 01:16:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70553378] [2023-11-29 01:16:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:16:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:16:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70553378] [2023-11-29 01:16:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70553378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858227602] [2023-11-29 01:16:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:23,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:23,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:23,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:23,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:16:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:24,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-29 01:16:24,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:24,321 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 [2023-11-29 01:16:24,646 WARN L854 $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) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2023-11-29 01:16:24,648 WARN L876 $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) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from true [2023-11-29 01:16:24,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:24,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:24,679 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.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) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (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 [2023-11-29 01:16:24,681 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.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) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (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 [2023-11-29 01:16:24,709 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:24,709 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 50 treesize of output 45 [2023-11-29 01:16:24,726 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 01:16:24,726 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 24 treesize of output 19 [2023-11-29 01:16:24,748 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (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 [2023-11-29 01:16:24,751 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (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 [2023-11-29 01:16:24,783 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |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 (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2023-11-29 01:16:24,786 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |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 (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2023-11-29 01:16:24,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))))) is different from false [2023-11-29 01:16:24,872 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))))) is different from true [2023-11-29 01:16:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 01:16:24,892 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 45 treesize of output 21 [2023-11-29 01:16:24,920 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:24,924 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:24,960 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:24,963 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:25,000 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:25,004 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:25,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:25,055 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 61 treesize of output 44 [2023-11-29 01:16:25,088 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 01:16:25,088 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 [2023-11-29 01:16:25,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-11-29 01:16:25,123 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-11-29 01:16:25,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-11-29 01:16:25,206 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-11-29 01:16:25,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-11-29 01:16:25,303 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-11-29 01:16:25,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-11-29 01:16:25,493 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-11-29 01:16:25,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-11-29 01:16:25,603 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-11-29 01:16:25,703 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-11-29 01:16:25,709 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-11-29 01:16:25,785 INFO L349 Elim1Store]: treesize reduction 77, result has 12.5 percent of original size [2023-11-29 01:16:25,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 104 [2023-11-29 01:16:25,820 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-29 01:16:25,821 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 273 treesize of output 194 [2023-11-29 01:16:25,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:25,830 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 145 [2023-11-29 01:16:25,847 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2023-11-29 01:16:25,848 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 162 treesize of output 137 [2023-11-29 01:16:25,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse4 4)))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse4 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-11-29 01:16:25,904 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse4 4)))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse4 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-11-29 01:16:25,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:16:25,939 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 178 treesize of output 118 [2023-11-29 01:16:25,955 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:25,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:16:25,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ .cse2 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 0)) (not (= .cse1 0)) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse2 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1)))))) is different from false [2023-11-29 01:16:25,996 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ .cse2 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 0)) (not (= .cse1 0)) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse2 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1)))))) is different from true [2023-11-29 01:16:26,050 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 77 treesize of output 57 [2023-11-29 01:16:26,120 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from false [2023-11-29 01:16:26,123 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from true [2023-11-29 01:16:26,164 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:26,164 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 54 treesize of output 25 [2023-11-29 01:16:26,182 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int) (v_arrayElimIndex_22 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= v_arrayElimIndex_22 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_22) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from false [2023-11-29 01:16:26,185 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int) (v_arrayElimIndex_22 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= v_arrayElimIndex_22 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_22) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from true [2023-11-29 01:16:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-11-29 01:16:26,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:27,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858227602] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:27,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:27,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 51 [2023-11-29 01:16:27,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821028591] [2023-11-29 01:16:27,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:27,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 01:16:27,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:27,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 01:16:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1691, Unknown=37, NotChecked=1782, Total=3660 [2023-11-29 01:16:27,293 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:16:27,650 WARN L854 $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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 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) (= (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) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-11-29 01:16:27,653 WARN L876 $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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 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) (= (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) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-11-29 01:16:27,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.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) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| .cse0) 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) (= |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 [2023-11-29 01:16:27,660 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.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) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| .cse0) 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) (= |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 [2023-11-29 01:16:27,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse0 .cse2) (not .cse2) (= (select |c_#valid| .cse1) 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| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from false [2023-11-29 01:16:27,667 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse0 .cse2) (not .cse2) (= (select |c_#valid| .cse1) 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| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from true [2023-11-29 01:16:27,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |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| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse2 0)) (= (select |c_#valid| .cse2) 1) .cse0 (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2023-11-29 01:16:27,675 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |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| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse2 0)) (= (select |c_#valid| .cse2) 1) .cse0 (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2023-11-29 01:16:27,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (not (= .cse2 .cse3)) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0))) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-11-29 01:16:27,685 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (not (= .cse2 .cse3)) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0))) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-11-29 01:16:27,691 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:27,694 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:27,699 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:27,703 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:27,721 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-11-29 01:16:27,727 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |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_22| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-11-29 01:16:27,740 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse3 .cse4)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-11-29 01:16:27,747 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse3 .cse4)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-11-29 01:16:27,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= .cse3 .cse6)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-11-29 01:16:27,771 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= .cse3 .cse6)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-11-29 01:16:27,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (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 (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:27,795 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (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 (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:27,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (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)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:27,823 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (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)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:27,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (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 (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:27,847 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (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 (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:27,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:27,865 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:27,887 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (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 (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:27,892 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (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 (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:27,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse5 4))) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= .cse1 0)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2023-11-29 01:16:27,911 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse5 4))) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (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_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= .cse1 0)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2023-11-29 01:16:27,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= .cse5 0)) (.cse3 (select .cse0 (+ .cse5 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) .cse1 (not (= .cse2 0)) (not (= .cse3 0)) (or (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))))))) is different from false [2023-11-29 01:16:27,933 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= .cse5 0)) (.cse3 (select .cse0 (+ .cse5 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) .cse1 (not (= .cse2 0)) (not (= .cse3 0)) (or (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))))))) is different from true [2023-11-29 01:16:27,980 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2023-11-29 01:16:27,983 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2023-11-29 01:16:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:29,307 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-11-29 01:16:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-29 01:16:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 states have internal predecessors, (61), 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 38 [2023-11-29 01:16:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:29,309 INFO L225 Difference]: With dead ends: 114 [2023-11-29 01:16:29,309 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 01:16:29,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=309, Invalid=3184, Unknown=73, NotChecked=5364, Total=8930 [2023-11-29 01:16:29,312 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2535 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:29,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 512 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 816 Invalid, 0 Unknown, 2535 Unchecked, 0.8s Time] [2023-11-29 01:16:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 01:16:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2023-11-29 01:16:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:16:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2023-11-29 01:16:29,332 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 38 [2023-11-29 01:16:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:29,332 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2023-11-29 01:16:29,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:16:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2023-11-29 01:16:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 01:16:29,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:29,333 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:16:29,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:16:29,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 01:16:29,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:29,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1361648050, now seen corresponding path program 2 times [2023-11-29 01:16:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090263605] [2023-11-29 01:16:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:16:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:16:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:31,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090263605] [2023-11-29 01:16:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090263605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445815272] [2023-11-29 01:16:31,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:16:31,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:31,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:31,437 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:31,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:16:31,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:16:31,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:16:31,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 148 conjunts are in the unsatisfiable core [2023-11-29 01:16:31,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:31,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:16:32,002 WARN L854 $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_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-11-29 01:16:32,005 WARN L876 $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_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-11-29 01:16:32,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:32,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:32,038 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2023-11-29 01:16:32,041 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from true [2023-11-29 01:16:32,061 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:32,061 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 [2023-11-29 01:16:32,083 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 01:16:32,083 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 [2023-11-29 01:16:32,097 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from false [2023-11-29 01:16:32,100 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from true [2023-11-29 01:16:32,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2023-11-29 01:16:32,146 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2023-11-29 01:16:32,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-11-29 01:16:32,217 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-11-29 01:16:32,228 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 [2023-11-29 01:16:32,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:16:32,257 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:32,260 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:32,292 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:32,294 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:32,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:32,331 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:32,335 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:32,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:32,367 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 38 [2023-11-29 01:16:32,385 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 01:16:32,385 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 36 treesize of output 39 [2023-11-29 01:16:32,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-11-29 01:16:32,472 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-11-29 01:16:32,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-11-29 01:16:32,569 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-11-29 01:16:32,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0)))))) is different from false [2023-11-29 01:16:32,656 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0)))))) is different from true [2023-11-29 01:16:32,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (or (= .cse3 .cse4) (= .cse2 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0)))))) is different from false [2023-11-29 01:16:32,814 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (or (= .cse3 .cse4) (= .cse2 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0)))))) is different from true [2023-11-29 01:16:33,031 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2023-11-29 01:16:33,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 118 [2023-11-29 01:16:33,069 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-29 01:16:33,069 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 367 treesize of output 252 [2023-11-29 01:16:33,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:33,084 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 122 treesize of output 75 [2023-11-29 01:16:33,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:33,093 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 0 case distinctions, treesize of input 226 treesize of output 167 [2023-11-29 01:16:33,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:33,125 INFO L349 Elim1Store]: treesize reduction 100, result has 18.7 percent of original size [2023-11-29 01:16:33,126 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 217 treesize of output 183 [2023-11-29 01:16:33,163 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 62 treesize of output 33 [2023-11-29 01:16:33,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse6 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse6))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse6) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse7 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1)))))) is different from false [2023-11-29 01:16:33,215 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse6 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse6))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse6) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse7 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1)))))) is different from true [2023-11-29 01:16:33,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:16:33,250 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 194 treesize of output 130 [2023-11-29 01:16:33,280 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:33,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:16:33,310 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (+ .cse4 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))))) is different from false [2023-11-29 01:16:33,313 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (+ .cse4 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))))) is different from true [2023-11-29 01:16:33,433 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from false [2023-11-29 01:16:33,436 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from true [2023-11-29 01:16:33,486 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:33,486 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 60 treesize of output 31 [2023-11-29 01:16:33,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:33,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:16:33,515 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2023-11-29 01:16:33,518 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2023-11-29 01:16:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-29 01:16:33,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:33,725 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2493 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2496)) (.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2490)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ 4 (select (select .cse4 .cse5) .cse6)))) (select (select (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2494))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2493))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-11-29 01:16:33,754 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2493 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2496)) (.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2490)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_2494))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2493))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-11-29 01:16:35,227 INFO L349 Elim1Store]: treesize reduction 955, result has 50.3 percent of original size [2023-11-29 01:16:35,227 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 2 case distinctions, treesize of input 6022 treesize of output 6008 [2023-11-29 01:16:35,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:16:35,265 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 2784 treesize of output 2784 [2023-11-29 01:16:35,284 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 3771 treesize of output 3060 [2023-11-29 01:16:35,389 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 240 treesize of output 3 [2023-11-29 01:16:35,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:16:35,428 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 3266 treesize of output 3033 [2023-11-29 01:16:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445815272] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:38,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 48 [2023-11-29 01:16:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046668233] [2023-11-29 01:16:38,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:38,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 01:16:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 01:16:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1258, Unknown=89, NotChecked=1602, Total=3080 [2023-11-29 01:16:38,307 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 39 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:16:39,096 WARN L854 $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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-11-29 01:16:39,099 WARN L876 $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) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-11-29 01:16:39,103 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.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) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-11-29 01:16:39,106 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.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) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-11-29 01:16:39,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 .cse3) (not .cse3) (= (select |c_#valid| .cse2) 1)))) is different from false [2023-11-29 01:16:39,113 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 .cse3) (not .cse3) (= (select |c_#valid| .cse2) 1)))) is different from true [2023-11-29 01:16:39,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2023-11-29 01:16:39,120 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2023-11-29 01:16:39,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 1))) (or (= .cse4 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-11-29 01:16:39,130 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 1))) (or (= .cse4 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-11-29 01:16:39,141 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:39,144 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:39,149 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-29 01:16:39,152 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-11-29 01:16:39,162 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-11-29 01:16:39,169 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-11-29 01:16:39,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse1)) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 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 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= .cse5 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (not (= .cse3 .cse6)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-11-29 01:16:39,185 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse1)) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 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 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= .cse5 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (not (= .cse3 .cse6)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-11-29 01:16:39,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-11-29 01:16:39,205 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-11-29 01:16:39,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse6 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:39,227 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse6 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:39,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse9 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (or (= .cse5 .cse6) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-11-29 01:16:39,254 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse9 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (or (= .cse5 .cse6) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-11-29 01:16:39,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse11 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse7 (+ .cse8 4))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse7)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse7) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse8 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4)))) (= (select .cse10 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) is different from false [2023-11-29 01:16:39,280 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse11 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse7 (+ .cse8 4))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse7)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse7) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse8 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4)))) (= (select .cse10 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) is different from true [2023-11-29 01:16:39,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ .cse7 4))) (let ((.cse1 (select .cse6 .cse4)) (.cse5 (= .cse7 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select .cse3 .cse4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) .cse5 (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse5 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse6 4)) (select .cse3 4))))))) is different from false [2023-11-29 01:16:39,297 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ .cse7 4))) (let ((.cse1 (select .cse6 .cse4)) (.cse5 (= .cse7 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select .cse3 .cse4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) .cse5 (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse5 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse6 4)) (select .cse3 4))))))) is different from true [2023-11-29 01:16:39,337 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from false [2023-11-29 01:16:39,340 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from true [2023-11-29 01:16:39,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 0) 1))) is different from false [2023-11-29 01:16:39,366 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 0) 1))) is different from true [2023-11-29 01:16:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:41,432 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2023-11-29 01:16:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-29 01:16:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 39 states have internal predecessors, (61), 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 38 [2023-11-29 01:16:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:41,433 INFO L225 Difference]: With dead ends: 112 [2023-11-29 01:16:41,433 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 01:16:41,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=256, Invalid=2400, Unknown=132, NotChecked=4522, Total=7310 [2023-11-29 01:16:41,436 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2293 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:41,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 496 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 948 Invalid, 0 Unknown, 2293 Unchecked, 0.9s Time] [2023-11-29 01:16:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 01:16:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2023-11-29 01:16:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:16:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2023-11-29 01:16:41,458 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 38 [2023-11-29 01:16:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:41,458 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2023-11-29 01:16:41,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 39 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:16:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2023-11-29 01:16:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 01:16:41,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:41,459 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:16:41,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 01:16:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 01:16:41,660 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:41,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1719814514, now seen corresponding path program 3 times [2023-11-29 01:16:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:41,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712189310] [2023-11-29 01:16:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:16:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:16:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:45,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:45,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712189310] [2023-11-29 01:16:45,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712189310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:45,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321591755] [2023-11-29 01:16:45,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:16:45,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:45,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:45,427 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:45,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:16:46,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 01:16:46,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:16:46,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 01:16:46,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:46,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:16:46,401 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 [2023-11-29 01:16:46,405 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 [2023-11-29 01:16:46,809 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:16:46,809 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 18 treesize of output 17 [2023-11-29 01:16:46,812 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 [2023-11-29 01:16:46,826 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:16:46,826 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 18 treesize of output 17 [2023-11-29 01:16:46,829 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 [2023-11-29 01:16:46,849 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:16:46,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:16:46,937 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 [2023-11-29 01:16:46,943 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 18 treesize of output 13 [2023-11-29 01:16:46,951 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 [2023-11-29 01:16:46,956 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 18 treesize of output 13 [2023-11-29 01:16:47,068 INFO L349 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2023-11-29 01:16:47,068 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 2 case distinctions, treesize of input 144 treesize of output 101 [2023-11-29 01:16:47,091 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-11-29 01:16:47,092 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 1 case distinctions, treesize of input 113 treesize of output 91 [2023-11-29 01:16:47,459 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2023-11-29 01:16:47,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 50 [2023-11-29 01:16:47,464 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 23 treesize of output 9 [2023-11-29 01:16:47,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 01:16:47,541 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 01:16:47,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:47,567 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 01:16:47,568 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 165 treesize of output 132 [2023-11-29 01:16:47,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:47,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:47,575 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 124 treesize of output 110 [2023-11-29 01:16:47,594 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 01:16:47,594 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 34 treesize of output 36 [2023-11-29 01:16:48,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:48,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:16:48,045 INFO L349 Elim1Store]: treesize reduction 96, result has 3.0 percent of original size [2023-11-29 01:16:48,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 54 [2023-11-29 01:16:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-11-29 01:16:48,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321591755] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:48,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:48,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 50 [2023-11-29 01:16:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244309227] [2023-11-29 01:16:48,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:48,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 01:16:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 01:16:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2724, Unknown=1, NotChecked=104, Total=2970 [2023-11-29 01:16:48,709 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 50 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 42 states have internal predecessors, (62), 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) [2023-11-29 01:16:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:52,536 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-11-29 01:16:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:16:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 42 states have internal predecessors, (62), 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 38 [2023-11-29 01:16:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:52,537 INFO L225 Difference]: With dead ends: 114 [2023-11-29 01:16:52,537 INFO L226 Difference]: Without dead ends: 96 [2023-11-29 01:16:52,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=331, Invalid=5222, Unknown=1, NotChecked=146, Total=5700 [2023-11-29 01:16:52,539 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:52,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 320 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1167 Invalid, 0 Unknown, 63 Unchecked, 1.3s Time] [2023-11-29 01:16:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-29 01:16:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2023-11-29 01:16:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 states have internal predecessors, (82), 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) [2023-11-29 01:16:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2023-11-29 01:16:52,569 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 38 [2023-11-29 01:16:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:52,570 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2023-11-29 01:16:52,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 42 states have internal predecessors, (62), 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) [2023-11-29 01:16:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2023-11-29 01:16:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 01:16:52,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:52,571 INFO L195 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] [2023-11-29 01:16:52,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:16:52,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 01:16:52,771 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:52,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1421216253, now seen corresponding path program 2 times [2023-11-29 01:16:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524771526] [2023-11-29 01:16:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:16:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:52,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:16:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:16:52,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:52,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524771526] [2023-11-29 01:16:52,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524771526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527015314] [2023-11-29 01:16:52,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:16:52,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:52,949 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:52,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 01:16:53,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:16:53,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:16:53,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:16:53,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 01:16:53,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 01:16:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527015314] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:16:53,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:16:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-11-29 01:16:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174121210] [2023-11-29 01:16:53,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:16:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:16:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:16:53,415 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:16:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:53,574 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2023-11-29 01:16:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:16:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-11-29 01:16:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:53,575 INFO L225 Difference]: With dead ends: 104 [2023-11-29 01:16:53,575 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 01:16:53,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:16:53,576 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:53,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:16:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 01:16:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2023-11-29 01:16:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.1625) internal successors, (93), 80 states have internal predecessors, (93), 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) [2023-11-29 01:16:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2023-11-29 01:16:53,602 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 40 [2023-11-29 01:16:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:53,602 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2023-11-29 01:16:53,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:16:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2023-11-29 01:16:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 01:16:53,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:53,603 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:53,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 01:16:53,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 01:16:53,804 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:53,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1421214579, now seen corresponding path program 4 times [2023-11-29 01:16:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:53,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590334545] [2023-11-29 01:16:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:53,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:16:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:16:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590334545] [2023-11-29 01:16:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590334545] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254983205] [2023-11-29 01:16:56,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:16:56,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:56,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:56,261 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:56,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f8e803-1120-460f-b3e5-9bd44bab8b41/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 01:16:56,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:16:56,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:16:56,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-29 01:16:56,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:56,515 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 [2023-11-29 01:16:56,519 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 [2023-11-29 01:16:56,575 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2023-11-29 01:16:56,576 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 36 [2023-11-29 01:16:56,587 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 01:16:56,587 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 42 treesize of output 35 [2023-11-29 01:16:56,594 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 19 treesize of output 15 [2023-11-29 01:16:56,840 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2023-11-29 01:16:56,840 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 49 treesize of output 18 [2023-11-29 01:16:57,353 INFO L349 Elim1Store]: treesize reduction 461, result has 37.3 percent of original size [2023-11-29 01:16:57,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 318 [2023-11-29 01:16:57,446 INFO L349 Elim1Store]: treesize reduction 162, result has 29.3 percent of original size [2023-11-29 01:16:57,446 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 1 case distinctions, treesize of input 175 treesize of output 151 [2023-11-29 01:17:01,062 INFO L349 Elim1Store]: treesize reduction 936, result has 17.2 percent of original size [2023-11-29 01:17:01,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 26 case distinctions, treesize of input 994 treesize of output 638 [2023-11-29 01:17:01,115 INFO L349 Elim1Store]: treesize reduction 285, result has 8.1 percent of original size [2023-11-29 01:17:01,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 937 treesize of output 540 [2023-11-29 01:17:02,272 INFO L349 Elim1Store]: treesize reduction 895, result has 29.9 percent of original size [2023-11-29 01:17:02,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1718 treesize of output 1183 [2023-11-29 01:17:02,378 INFO L349 Elim1Store]: treesize reduction 357, result has 9.4 percent of original size [2023-11-29 01:17:02,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1291 treesize of output 633 [2023-11-29 01:17:19,968 INFO L349 Elim1Store]: treesize reduction 153, result has 24.3 percent of original size [2023-11-29 01:17:19,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 383 treesize of output 248 [2023-11-29 01:17:20,011 INFO L349 Elim1Store]: treesize reduction 192, result has 16.9 percent of original size [2023-11-29 01:17:20,011 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 5 case distinctions, treesize of input 373 treesize of output 235 [2023-11-29 01:19:10,448 WARN L293 SmtUtils]: Spent 30.31s on a formula simplification. DAG size of input: 547 DAG size of output: 492 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:19:17,272 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 43838 treesize of output 36230 [2023-11-29 01:19:17,878 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 36234 treesize of output 29546 [2023-11-29 01:20:10,103 WARN L293 SmtUtils]: Spent 16.46s on a formula simplification that was a NOOP. DAG size: 4298 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:22:11,109 WARN L293 SmtUtils]: Spent 35.68s on a formula simplification. DAG size of input: 4755 DAG size of output: 4755 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:23:18,326 WARN L293 SmtUtils]: Spent 20.72s on a formula simplification that was a NOOP. DAG size: 4761 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:25:17,448 WARN L293 SmtUtils]: Spent 24.59s on a formula simplification that was a NOOP. DAG size: 4965 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:26:46,382 WARN L293 SmtUtils]: Spent 25.93s on a formula simplification that was a NOOP. DAG size: 4970 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:27:03,063 INFO L224 Elim1Store]: Index analysis took 133 ms