./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:30:16,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:30:16,463 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:30:16,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:30:16,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:30:16,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:30:16,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:30:16,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:30:16,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:30:16,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:30:16,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:30:16,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:30:16,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:30:16,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:30:16,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:30:16,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:30:16,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:30:16,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:30:16,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:30:16,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:30:16,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:30:16,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:30:16,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:30:16,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:30:16,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:30:16,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:30:16,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:30:16,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:30:16,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:30:16,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:16,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:16,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:16,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:16,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:30:16,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:16,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:16,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:30:16,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:30:16,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:30:16,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:30:16,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2024-11-27 23:30:16,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:30:16,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:30:16,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:30:16,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:30:16,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:30:16,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-27 23:30:19,815 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/data/6088862aa/7ac64045b7074e8c811a2ba74ed255c8/FLAG76c12fe39 [2024-11-27 23:30:20,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:30:20,228 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-27 23:30:20,251 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/data/6088862aa/7ac64045b7074e8c811a2ba74ed255c8/FLAG76c12fe39 [2024-11-27 23:30:20,273 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/data/6088862aa/7ac64045b7074e8c811a2ba74ed255c8 [2024-11-27 23:30:20,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:30:20,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:30:20,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:20,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:30:20,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:30:20,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49eb55a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20, skipping insertion in model container [2024-11-27 23:30:20,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:30:20,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2024-11-27 23:30:20,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:20,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:30:20,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2024-11-27 23:30:20,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:30:20,792 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:30:20,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20 WrapperNode [2024-11-27 23:30:20,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:30:20,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:20,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:30:20,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:30:20,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,853 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2024-11-27 23:30:20,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:30:20,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:30:20,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:30:20,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:30:20,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,888 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2024-11-27 23:30:20,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:30:20,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:30:20,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:30:20,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:30:20,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (1/1) ... [2024-11-27 23:30:20,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:20,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:20,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:30:20,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-27 23:30:20,974 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:30:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:30:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:30:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:30:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:30:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:30:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:30:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:30:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:30:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:30:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:30:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:30:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 23:30:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:30:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:30:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:30:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:30:20,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:30:21,145 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:30:21,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:30:21,392 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-27 23:30:21,392 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:30:21,401 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:30:21,402 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-27 23:30:21,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:21 BoogieIcfgContainer [2024-11-27 23:30:21,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:30:21,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:30:21,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:30:21,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:30:21,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:30:20" (1/3) ... [2024-11-27 23:30:21,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b01b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:21, skipping insertion in model container [2024-11-27 23:30:21,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:30:20" (2/3) ... [2024-11-27 23:30:21,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b01b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:30:21, skipping insertion in model container [2024-11-27 23:30:21,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:30:21" (3/3) ... [2024-11-27 23:30:21,416 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2024-11-27 23:30:21,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:30:21,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_prepend_unequal.i that has 2 procedures, 36 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-27 23:30:21,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:30:21,510 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@46bbf700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:30:21,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:30:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:30:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 23:30:21,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:21,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:21,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:21,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1640936773, now seen corresponding path program 1 times [2024-11-27 23:30:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173162413] [2024-11-27 23:30:21,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:30:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173162413] [2024-11-27 23:30:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173162413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:21,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:30:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962530804] [2024-11-27 23:30:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:21,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:30:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:21,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:30:21,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:30:21,877 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:30:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:21,895 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2024-11-27 23:30:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:30:21,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 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 23 [2024-11-27 23:30:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:21,902 INFO L225 Difference]: With dead ends: 63 [2024-11-27 23:30:21,903 INFO L226 Difference]: Without dead ends: 27 [2024-11-27 23:30:21,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:30:21,909 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:21,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-27 23:30:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-27 23:30:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:30:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-27 23:30:21,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 23 [2024-11-27 23:30:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:21,946 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-27 23:30:21,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:30:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-27 23:30:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 23:30:21,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:21,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:21,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:30:21,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:21,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash -882294319, now seen corresponding path program 1 times [2024-11-27 23:30:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:21,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873696996] [2024-11-27 23:30:21,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:30:22,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873696996] [2024-11-27 23:30:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873696996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:22,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:30:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285962663] [2024-11-27 23:30:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:30:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:30:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:22,345 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:30:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:22,365 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-11-27 23:30:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:30:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 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 23 [2024-11-27 23:30:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:22,367 INFO L225 Difference]: With dead ends: 50 [2024-11-27 23:30:22,367 INFO L226 Difference]: Without dead ends: 32 [2024-11-27 23:30:22,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:30:22,368 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:22,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-27 23:30:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-27 23:30:22,373 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) [2024-11-27 23:30:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-27 23:30:22,375 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2024-11-27 23:30:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:22,375 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-27 23:30:22,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:30:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-27 23:30:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-27 23:30:22,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:22,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:30:22,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 595673600, now seen corresponding path program 1 times [2024-11-27 23:30:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932466241] [2024-11-27 23:30:22,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 23:30:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932466241] [2024-11-27 23:30:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932466241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882879376] [2024-11-27 23:30:23,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:23,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:23,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:30:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:23,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-27 23:30:23,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:23,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 23:30:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:30:23,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 23:30:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882879376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:23,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:30:23,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2024-11-27 23:30:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401187720] [2024-11-27 23:30:23,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:23,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 23:30:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:23,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 23:30:23,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:30:23,721 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:30:27,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:31,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:35,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:39,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:44,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:48,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:52,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:52,473 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-11-27 23:30:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:30:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-27 23:30:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:52,475 INFO L225 Difference]: With dead ends: 59 [2024-11-27 23:30:52,475 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 23:30:52,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:30:52,476 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:52,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 28.6s Time] [2024-11-27 23:30:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 23:30:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-27 23:30:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 23:30:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-27 23:30:52,484 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2024-11-27 23:30:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-27 23:30:52,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:30:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-27 23:30:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-27 23:30:52,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:52,486 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:30:52,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:30:52,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:52,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 595733182, now seen corresponding path program 1 times [2024-11-27 23:30:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:30:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756773341] [2024-11-27 23:30:52,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:30:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756773341] [2024-11-27 23:30:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756773341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:30:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410746782] [2024-11-27 23:30:56,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:30:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:56,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:56,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:30:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:56,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-27 23:30:56,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:56,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 23:30:56,890 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 23:30:56,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-27 23:30:57,081 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-27 23:30:57,082 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 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-27 23:30:57,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-27 23:30:57,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2024-11-27 23:30:57,121 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 16 treesize of output 1 [2024-11-27 23:30:57,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:57,401 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 80 treesize of output 45 [2024-11-27 23:30:57,417 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-27 23:30:57,417 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 40 treesize of output 35 [2024-11-27 23:30:57,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 23:30:57,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:30:57,637 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 89 treesize of output 66 [2024-11-27 23:30:57,682 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2024-11-27 23:30:57,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 100 [2024-11-27 23:30:57,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 169 treesize of output 174 [2024-11-27 23:30:57,983 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 0 case distinctions, treesize of input 218 treesize of output 155 [2024-11-27 23:30:57,992 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 0 case distinctions, treesize of input 162 treesize of output 123 [2024-11-27 23:30:58,000 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 123 treesize of output 87 [2024-11-27 23:30:58,021 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 28 treesize of output 15 [2024-11-27 23:30:58,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 155 [2024-11-27 23:30:58,082 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 0 case distinctions, treesize of input 213 treesize of output 154 [2024-11-27 23:30:58,092 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 0 case distinctions, treesize of input 154 treesize of output 115 [2024-11-27 23:30:58,104 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 23:30:58,105 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 1 case distinctions, treesize of input 122 treesize of output 82 [2024-11-27 23:30:58,121 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 28 treesize of output 15 [2024-11-27 23:30:58,146 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_int#1| .cse0)) (.cse1 (+ .cse5 4))) (let ((.cse4 (+ 8 .cse5)) (.cse2 (select .cse3 .cse1))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_arrayElimCell_17 Int) (v_arrayElimCell_15 Int)) (and (not (= .cse0 v_arrayElimCell_17)) (not (= .cse0 v_arrayElimCell_15)) (= (store (select (store (store (store |c_#memory_int#1| .cse0 v_DerPreprocessor_3) v_arrayElimCell_15 (select |c_#memory_int#1| v_arrayElimCell_15)) v_arrayElimCell_17 (select |c_#memory_int#1| v_arrayElimCell_17)) .cse0) .cse1 .cse2) .cse3) (= (select v_DerPreprocessor_3 .cse4) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_arrayElimCell_17 v_arrayElimCell_15)))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_arrayElimCell_23 Int)) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_DerPreprocessor_5 .cse4)) (not (= .cse0 v_arrayElimCell_23)) (= (store (select (store (store |c_#memory_int#1| .cse0 v_DerPreprocessor_5) v_arrayElimCell_23 (select |c_#memory_int#1| v_arrayElimCell_23)) .cse0) .cse1 .cse2) .cse3))))))) is different from true [2024-11-27 23:30:58,179 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 176 treesize of output 128 [2024-11-27 23:30:58,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:58,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 389 treesize of output 381 [2024-11-27 23:30:58,276 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 93 treesize of output 65 [2024-11-27 23:30:58,294 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2024-11-27 23:30:58,313 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2024-11-27 23:30:58,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:58,430 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 26 treesize of output 14 [2024-11-27 23:30:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:30:58,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:58,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (not (= v_ArrVal_535 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_528)) .cse0 v_ArrVal_533) .cse1 v_ArrVal_534) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_535 .cse2))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_533) .cse1 v_ArrVal_534) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_535) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2024-11-27 23:30:58,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_533) .cse1 v_ArrVal_534) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_535) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_528)) .cse0 v_ArrVal_533) .cse1 v_ArrVal_534) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse4 (select v_ArrVal_535 .cse4))) v_ArrVal_535))))))) is different from false [2024-11-27 23:30:58,816 INFO L349 Elim1Store]: treesize reduction 167, result has 42.2 percent of original size [2024-11-27 23:30:58,816 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 3 case distinctions, treesize of input 8765 treesize of output 8393 [2024-11-27 23:30:58,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:30:58,882 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 1098 treesize of output 1094 [2024-11-27 23:30:58,907 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 1494 treesize of output 1334 [2024-11-27 23:30:58,933 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 1478 treesize of output 1398 [2024-11-27 23:30:58,969 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 20 treesize of output 4 [2024-11-27 23:31:03,940 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-27 23:31:03,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 760 treesize of output 696 [2024-11-27 23:31:04,669 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 15 treesize of output 7 [2024-11-27 23:31:04,727 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 15 treesize of output 7 [2024-11-27 23:31:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410746782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:05,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:31:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2024-11-27 23:31:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051556785] [2024-11-27 23:31:05,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-27 23:31:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:05,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-27 23:31:05,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1099, Unknown=3, NotChecked=204, Total=1406 [2024-11-27 23:31:05,308 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 34 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-27 23:31:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:07,773 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-27 23:31:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-27 23:31:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2024-11-27 23:31:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:07,774 INFO L225 Difference]: With dead ends: 38 [2024-11-27 23:31:07,774 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 23:31:07,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=166, Invalid=1821, Unknown=5, NotChecked=264, Total=2256 [2024-11-27 23:31:07,776 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:07,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 286 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 538 Invalid, 0 Unknown, 36 Unchecked, 1.8s Time] [2024-11-27 23:31:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 23:31:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-27 23:31:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-27 23:31:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-27 23:31:07,784 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2024-11-27 23:31:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:07,784 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-27 23:31:07,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-27 23:31:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-27 23:31:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 23:31:07,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:07,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:07,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:31:07,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:07,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1268958361, now seen corresponding path program 1 times [2024-11-27 23:31:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519478841] [2024-11-27 23:31:07,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:31:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519478841] [2024-11-27 23:31:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519478841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361409888] [2024-11-27 23:31:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:11,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:11,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42cf2418-9018-4eeb-86bd-dfa95d8b8017/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:31:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:11,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-27 23:31:11,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:11,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 23:31:11,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 23:31:11,765 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2024-11-27 23:31:11,767 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2024-11-27 23:31:11,795 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 23 treesize of output 11 [2024-11-27 23:31:11,807 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) is different from false [2024-11-27 23:31:11,810 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) is different from true [2024-11-27 23:31:11,836 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:31:11,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-27 23:31:11,858 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from false [2024-11-27 23:31:11,860 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from true [2024-11-27 23:31:11,885 WARN L851 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2024-11-27 23:31:11,887 WARN L873 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2024-11-27 23:31:11,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-27 23:31:11,941 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 12 treesize of output 11 [2024-11-27 23:31:11,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:11,975 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 30 treesize of output 27 [2024-11-27 23:31:11,980 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 18 treesize of output 11 [2024-11-27 23:31:11,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse0) .cse2) (= (select v_DerPreprocessor_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2024-11-27 23:31:11,995 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_7) .cse0 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse0) .cse2) (= (select v_DerPreprocessor_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2024-11-27 23:31:12,057 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_7) .cse1 v_DerPreprocessor_8) .cse0) 4 .cse1) .cse2) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |c_#valid| .cse0) 1)))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-11-27 23:31:12,061 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_8 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_7) .cse1 v_DerPreprocessor_8) .cse0) 4 .cse1) .cse2) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |c_#valid| .cse0) 1)))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-11-27 23:31:12,079 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 9 treesize of output 3 [2024-11-27 23:31:12,093 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 70 treesize of output 42 [2024-11-27 23:31:12,119 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 23:31:12,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 59 [2024-11-27 23:31:12,129 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 33 treesize of output 36 [2024-11-27 23:31:12,150 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 15 treesize of output 11 [2024-11-27 23:31:12,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:31:12,169 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 21 treesize of output 25 [2024-11-27 23:31:12,205 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_56 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_56) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-27 23:31:12,208 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_56 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_56) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-27 23:31:12,243 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_56 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_56) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-27 23:31:12,246 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_56 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_56) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-27 23:31:12,318 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_56 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_56) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2024-11-27 23:31:12,322 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_56 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_56) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2024-11-27 23:31:12,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:12,409 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 78 treesize of output 49 [2024-11-27 23:31:12,434 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-27 23:31:12,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 87 [2024-11-27 23:31:12,457 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 23:31:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-27 23:31:12,494 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 63 treesize of output 66 [2024-11-27 23:31:12,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-27 23:31:12,517 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 13 treesize of output 11 [2024-11-27 23:31:12,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))))) is different from false [2024-11-27 23:31:12,551 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0))))) is different from true [2024-11-27 23:31:12,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-27 23:31:12,697 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-27 23:31:12,780 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,800 WARN L200 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,833 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,847 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,873 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,885 WARN L200 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,923 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,941 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,968 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:12,985 WARN L200 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:13,012 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:13,032 WARN L200 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:13,076 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:31:13,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 323 [2024-11-27 23:31:13,135 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2024-11-27 23:31:13,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 411 treesize of output 328 [2024-11-27 23:31:13,373 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-27 23:31:13,374 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 505 treesize of output 357 [2024-11-27 23:31:13,405 INFO L349 Elim1Store]: treesize reduction 134, result has 0.7 percent of original size [2024-11-27 23:31:13,405 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 7 case distinctions, treesize of input 1432 treesize of output 752 [2024-11-27 23:31:13,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 138 [2024-11-27 23:31:13,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:13,457 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 124 treesize of output 42 [2024-11-27 23:31:13,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 141 [2024-11-27 23:31:13,478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 51 [2024-11-27 23:31:13,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2024-11-27 23:31:13,495 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 55 treesize of output 47 [2024-11-27 23:31:13,527 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 27 treesize of output 35 [2024-11-27 23:31:13,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2024-11-27 23:31:13,542 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 42 treesize of output 23 [2024-11-27 23:31:13,588 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-27 23:31:13,589 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-27 23:31:14,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select .cse11 (+ .cse2 4))) (.cse0 (select .cse11 .cse2))) (and (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= .cse0 .cse1)) (not (= .cse1 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 .cse3)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (let ((.cse7 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (and (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1))))) (or (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse6)) (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))) .cse7 (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse9)) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (not (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))) (and .cse7 (or (= .cse2 0) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))))))))))) is different from false [2024-11-27 23:31:14,246 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select .cse11 (+ .cse2 4))) (.cse0 (select .cse11 .cse2))) (and (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= .cse0 .cse1)) (not (= .cse1 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 .cse3)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (let ((.cse7 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (and (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1))))) (or (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse6)) (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))) .cse7 (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_56 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse9)) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_56) 1)))) (not (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))) (and .cse7 (or (= .cse2 0) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))))))))))) is different from true [2024-11-27 23:31:14,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:31:14,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 410 treesize of output 390 [2024-11-27 23:31:14,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:31:14,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 313 [2024-11-27 23:31:16,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse1 (select .cse3 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (and (= (select (select |c_#memory_int#1| .cse0) 8) 1) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))) is different from false [2024-11-27 23:31:16,252 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse1 (select .cse3 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (and (= (select (select |c_#memory_int#1| .cse0) 8) 1) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))) is different from true [2024-11-27 23:31:16,272 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 80 treesize of output 38 [2024-11-27 23:31:16,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 23:31:16,311 WARN L851 $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_arrayElimCell_94 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_13| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_94)) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from false [2024-11-27 23:31:16,313 WARN L873 $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_arrayElimCell_94 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_13| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_94)) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from true [2024-11-27 23:31:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-27 23:31:16,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:17,249 INFO L349 Elim1Store]: treesize reduction 480, result has 40.8 percent of original size [2024-11-27 23:31:17,249 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 6 case distinctions, treesize of input 5498 treesize of output 4304 [2024-11-27 23:31:17,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:31:17,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3216 treesize of output 2492 [2024-11-27 23:31:17,528 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 2050 treesize of output 2018 [2024-11-27 23:31:17,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1016 treesize of output 1000 [2024-11-27 23:31:17,764 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 20 treesize of output 4 [2024-11-27 23:31:20,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:42,544 WARN L286 SmtUtils]: Spent 21.87s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:31:42,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:31:42,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 9202 treesize of output 9070 [2024-11-27 23:31:53,732 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:00,765 WARN L286 SmtUtils]: Spent 46.56s on a formula simplification. DAG size of input: 31 DAG size of output: 27 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:33:00,765 INFO L349 Elim1Store]: treesize reduction 14, result has 78.5 percent of original size [2024-11-27 23:33:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8994 treesize of output 8872 [2024-11-27 23:33:12,247 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:33:17,614 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:38:09,605 WARN L286 SmtUtils]: Spent 4.07m on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:38:09,605 INFO L349 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2024-11-27 23:38:09,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 133035 treesize of output 128085 [2024-11-27 23:38:21,526 WARN L286 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:38:21,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:38:21,537 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 1 case distinctions, treesize of input 127979 treesize of output 127983 [2024-11-27 23:38:32,456 WARN L286 SmtUtils]: Spent 9.26s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:38:32,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:38:32,467 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 1 case distinctions, treesize of input 127962 treesize of output 127966 [2024-11-27 23:38:43,188 WARN L286 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:38:43,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:38:43,198 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 1 case distinctions, treesize of input 127945 treesize of output 127949 [2024-11-27 23:38:54,461 WARN L286 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:38:54,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:38:54,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127928 treesize of output 127932 [2024-11-27 23:39:05,847 WARN L286 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:39:05,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:39:05,857 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 1 case distinctions, treesize of input 127911 treesize of output 127915 [2024-11-27 23:39:23,402 WARN L286 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:39:23,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:39:23,412 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 1 case distinctions, treesize of input 127894 treesize of output 127898 [2024-11-27 23:39:41,174 WARN L286 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:39:41,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:39:41,183 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 1 case distinctions, treesize of input 127877 treesize of output 127881 [2024-11-27 23:39:57,218 WARN L286 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:39:57,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:39:57,233 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 1 case distinctions, treesize of input 127860 treesize of output 127864 [2024-11-27 23:40:15,505 WARN L286 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:40:15,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:40:15,515 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 1 case distinctions, treesize of input 127843 treesize of output 127847 [2024-11-27 23:40:34,940 WARN L286 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:40:34,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:40:34,950 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 1 case distinctions, treesize of input 127826 treesize of output 127830 [2024-11-27 23:40:53,827 WARN L286 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:40:53,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:40:53,838 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 1 case distinctions, treesize of input 127809 treesize of output 127813 [2024-11-27 23:41:13,433 WARN L286 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:41:13,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:41:13,442 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 1 case distinctions, treesize of input 127792 treesize of output 127796 [2024-11-27 23:41:35,603 WARN L286 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:41:35,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:41:35,618 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 1 case distinctions, treesize of input 127775 treesize of output 127779 [2024-11-27 23:41:57,164 WARN L286 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:41:57,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:41:57,174 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 1 case distinctions, treesize of input 127758 treesize of output 127762 [2024-11-27 23:42:19,653 WARN L286 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:42:19,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:42:19,662 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 1 case distinctions, treesize of input 127741 treesize of output 127745 [2024-11-27 23:42:42,915 WARN L286 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:42:42,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:42:42,926 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 1 case distinctions, treesize of input 127724 treesize of output 127728 [2024-11-27 23:43:07,235 WARN L286 SmtUtils]: Spent 9.78s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:43:07,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:43:07,248 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 1 case distinctions, treesize of input 127707 treesize of output 127711 [2024-11-27 23:43:35,576 WARN L286 SmtUtils]: Spent 9.30s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:43:35,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:43:35,588 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 1 case distinctions, treesize of input 127690 treesize of output 127694 [2024-11-27 23:44:20,480 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:44:20,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:44:20,491 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 1 case distinctions, treesize of input 127673 treesize of output 127677 [2024-11-27 23:45:04,787 WARN L286 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:45:04,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:45:04,800 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 1 case distinctions, treesize of input 127656 treesize of output 127660