./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx --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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:46,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:46,223 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:14:46,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:46,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:46,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:46,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:46,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:46,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:14:46,266 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:14:46,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:14:46,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:14:46,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:46,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:46,271 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:46,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:46,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:14:46,275 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:46,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:46,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:46,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:46,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:14:46,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:14:46,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:14:46,278 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:46,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:14:46,279 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:46,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:46,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:46,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:14:46,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:14:46,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:46,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:46,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:14:46,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:14:46,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:46,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:14:46,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:14:46,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:14:46,283 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:14:46,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:14:46,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:14:46,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2023-11-21 22:14:46,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:46,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:46,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:46,639 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:46,640 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:46,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-21 22:14:49,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:50,071 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:50,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-11-21 22:14:50,085 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/data/11c434d27/82ecbb561f9f4bed871469e6facccd8f/FLAGa950dec7e [2023-11-21 22:14:50,098 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/data/11c434d27/82ecbb561f9f4bed871469e6facccd8f [2023-11-21 22:14:50,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:50,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:50,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:50,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:50,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:50,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad7276a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50, skipping insertion in model container [2023-11-21 22:14:50,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,214 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:50,606 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-21 22:14:50,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:50,627 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:50,691 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2023-11-21 22:14:50,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:50,728 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:50,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50 WrapperNode [2023-11-21 22:14:50,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:50,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:50,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:50,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:50,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,783 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-21 22:14:50,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:50,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:50,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:50,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:50,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,802 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,828 INFO L187 HeapSplitter]: Split 31 memory accesses to 3 slices as follows [2, 20, 9] [2023-11-21 22:14:50,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:50,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:50,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:50,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:50,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (1/1) ... [2023-11-21 22:14:50,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:50,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:50,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:14:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:14:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:14:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:14:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:14:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:14:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 22:14:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 22:14:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:14:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:14:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 22:14:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 22:14:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 22:14:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 22:14:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 22:14:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 22:14:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:14:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 22:14:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 22:14:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 22:14:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:14:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:14:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:14:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:51,125 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:51,127 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:51,412 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:51,568 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:51,568 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:14:51,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:51 BoogieIcfgContainer [2023-11-21 22:14:51,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:51,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:14:51,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:14:51,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:14:51,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:14:50" (1/3) ... [2023-11-21 22:14:51,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a35962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:51, skipping insertion in model container [2023-11-21 22:14:51,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:50" (2/3) ... [2023-11-21 22:14:51,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a35962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:51, skipping insertion in model container [2023-11-21 22:14:51,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:51" (3/3) ... [2023-11-21 22:14:51,584 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-11-21 22:14:51,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:14:51,604 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 22:14:51,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:14:51,678 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56063e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:14:51,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:14:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:14:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 22:14:51,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:51,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:51,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:51,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 623339324, now seen corresponding path program 1 times [2023-11-21 22:14:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269899445] [2023-11-21 22:14:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269899445] [2023-11-21 22:14:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269899445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:52,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:52,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:14:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918583558] [2023-11-21 22:14:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:52,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:14:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:52,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:14:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:52,493 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-21 22:14:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:52,950 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2023-11-21 22:14:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:14:52,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 15 [2023-11-21 22:14:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:52,957 INFO L225 Difference]: With dead ends: 47 [2023-11-21 22:14:52,958 INFO L226 Difference]: Without dead ends: 22 [2023-11-21 22:14:52,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:52,964 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:52,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:14:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-21 22:14:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-11-21 22:14:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:14:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-21 22:14:53,010 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2023-11-21 22:14:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:53,012 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-21 22:14:53,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-21 22:14:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-21 22:14:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 22:14:53,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:53,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:53,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:14:53,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:53,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1863685629, now seen corresponding path program 1 times [2023-11-21 22:14:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650579948] [2023-11-21 22:14:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:14:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:14:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:14:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650579948] [2023-11-21 22:14:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650579948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465827754] [2023-11-21 22:14:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:57,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:57,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:57,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:14:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:58,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-21 22:14:58,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:58,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:14:58,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:14:58,698 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:14:58,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 22:14:58,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-21 22:14:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:58,847 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 23 treesize of output 11 [2023-11-21 22:14:58,854 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 16 treesize of output 11 [2023-11-21 22:14:58,980 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 32 treesize of output 48 [2023-11-21 22:14:58,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:58,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-21 22:14:59,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-21 22:14:59,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 29 [2023-11-21 22:14:59,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-21 22:14:59,386 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 22:14:59,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-21 22:14:59,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:59,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2023-11-21 22:14:59,439 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-21 22:14:59,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-21 22:14:59,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 130 [2023-11-21 22:14:59,695 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-21 22:14:59,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 77 [2023-11-21 22:14:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:59,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-11-21 22:14:59,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:59,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:59,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:59,739 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 9 [2023-11-21 22:14:59,749 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 [2023-11-21 22:14:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:59,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:15:00,141 INFO L349 Elim1Store]: treesize reduction 116, result has 44.5 percent of original size [2023-11-21 22:15:00,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 258 treesize of output 376 [2023-11-21 22:15:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465827754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:00,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:15:00,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2023-11-21 22:15:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141967465] [2023-11-21 22:15:00,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:15:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-21 22:15:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:00,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-21 22:15:00,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1143, Unknown=16, NotChecked=0, Total=1260 [2023-11-21 22:15:00,989 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:15:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:04,425 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-11-21 22:15:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:15:04,426 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2023-11-21 22:15:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:04,427 INFO L225 Difference]: With dead ends: 26 [2023-11-21 22:15:04,427 INFO L226 Difference]: Without dead ends: 24 [2023-11-21 22:15:04,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=1635, Unknown=16, NotChecked=0, Total=1806 [2023-11-21 22:15:04,430 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:04,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 248 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-21 22:15:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-21 22:15:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-11-21 22:15:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:15:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-11-21 22:15:04,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 21 [2023-11-21 22:15:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:04,438 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-11-21 22:15:04,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:15:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-11-21 22:15:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 22:15:04,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:04,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:04,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:04,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:04,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:04,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 77138722, now seen corresponding path program 1 times [2023-11-21 22:15:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186670805] [2023-11-21 22:15:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:15:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:15:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:15:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186670805] [2023-11-21 22:15:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186670805] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640550690] [2023-11-21 22:15:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:07,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:15:07,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:15:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:07,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-21 22:15:07,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:07,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:15:07,681 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) is different from false [2023-11-21 22:15:07,684 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) is different from true [2023-11-21 22:15:07,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-21 22:15:07,732 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:15:07,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-21 22:15:07,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 22:15:07,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:07,763 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) is different from false [2023-11-21 22:15:07,766 WARN L876 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) is different from true [2023-11-21 22:15:07,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-11-21 22:15:07,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 23 [2023-11-21 22:15:07,879 WARN L854 $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|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select .cse1 0) .cse2) (= .cse2 .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_5| .cse2) 1))))))) is different from false [2023-11-21 22:15:07,882 WARN L876 $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|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select .cse1 0) .cse2) (= .cse2 .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_5| .cse2) 1))))))) is different from true [2023-11-21 22:15:08,125 WARN L854 $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|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse2 (select |v_old(#valid)_AFTER_CALL_6| .cse2))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 0) .cse1) (not (= .cse1 0)))))) is different from false [2023-11-21 22:15:08,129 WARN L876 $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|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse2 (select |v_old(#valid)_AFTER_CALL_6| .cse2))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 0) .cse1) (not (= .cse1 0)))))) is different from true [2023-11-21 22:15:08,221 INFO L349 Elim1Store]: treesize reduction 121, result has 0.8 percent of original size [2023-11-21 22:15:08,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 104 [2023-11-21 22:15:08,236 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 22:15:08,260 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-21 22:15:08,261 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 123 [2023-11-21 22:15:08,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2023-11-21 22:15:08,288 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 22:15:08,318 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-21 22:15:08,318 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 123 [2023-11-21 22:15:08,329 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 22:15:08,385 INFO L349 Elim1Store]: treesize reduction 117, result has 7.1 percent of original size [2023-11-21 22:15:08,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 180 [2023-11-21 22:15:08,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 26 [2023-11-21 22:15:08,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-11-21 22:15:08,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:08,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:08,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:08,470 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 67 treesize of output 65 [2023-11-21 22:15:08,589 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-21 22:15:08,589 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 174 [2023-11-21 22:15:08,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:15:08,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:15:08,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2023-11-21 22:15:08,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-21 22:15:08,649 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 57 treesize of output 13 [2023-11-21 22:15:08,654 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 [2023-11-21 22:15:08,678 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-11-21 22:15:08,679 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 123 [2023-11-21 22:15:08,689 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 22:15:08,705 WARN L854 $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|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_arrayElimCell_32 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_22) .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24))) (let ((.cse5 (select .cse2 .cse0))) (let ((.cse3 (select .cse5 4))) (and (= .cse1 (select (select .cse2 .cse3) v_arrayElimCell_32)) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_6| .cse1) 0) (= v_DerPreprocessor_21 .cse3) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |v_old(#valid)_AFTER_CALL_6| .cse4))) |v_old(#valid)_AFTER_CALL_6|) (= (select .cse5 0) .cse3) (not (= .cse3 0)) (= .cse6 (store (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24) .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0) 4 .cse1))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))))) is different from false [2023-11-21 22:15:08,709 WARN L876 $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|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_arrayElimCell_32 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_22) .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24))) (let ((.cse5 (select .cse2 .cse0))) (let ((.cse3 (select .cse5 4))) (and (= .cse1 (select (select .cse2 .cse3) v_arrayElimCell_32)) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_6| .cse1) 0) (= v_DerPreprocessor_21 .cse3) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |v_old(#valid)_AFTER_CALL_6| .cse4))) |v_old(#valid)_AFTER_CALL_6|) (= (select .cse5 0) .cse3) (not (= .cse3 0)) (= .cse6 (store (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24) .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0) 4 .cse1))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))))) is different from true [2023-11-21 22:15:08,868 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 360 treesize of output 220 [2023-11-21 22:15:08,916 INFO L349 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2023-11-21 22:15:08,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1025 treesize of output 906 [2023-11-21 22:15:09,009 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-11-21 22:15:09,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 451 treesize of output 427 [2023-11-21 22:15:09,049 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 298 treesize of output 294 [2023-11-21 22:15:09,107 INFO L349 Elim1Store]: treesize reduction 24, result has 36.8 percent of original size [2023-11-21 22:15:09,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 381 [2023-11-21 22:15:09,386 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:15:09,387 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 15 treesize of output 11 [2023-11-21 22:15:09,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-11-21 22:15:09,417 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_39 0)) (= (select |v_old(#valid)_AFTER_CALL_5| v_arrayElimCell_39) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |v_old(#valid)_AFTER_CALL_6| .cse0))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) is different from false [2023-11-21 22:15:09,419 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_39 0)) (= (select |v_old(#valid)_AFTER_CALL_5| v_arrayElimCell_39) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |v_old(#valid)_AFTER_CALL_6| .cse0))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) is different from true [2023-11-21 22:15:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:15:09,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:15:09,712 INFO L349 Elim1Store]: treesize reduction 134, result has 45.5 percent of original size [2023-11-21 22:15:09,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 442 [2023-11-21 22:15:09,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:09,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 275 treesize of output 324 [2023-11-21 22:15:10,016 INFO L349 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2023-11-21 22:15:10,016 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 2 case distinctions, treesize of input 75 treesize of output 13 [2023-11-21 22:15:10,072 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 73 treesize of output 65 [2023-11-21 22:15:10,086 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 80 treesize of output 72 [2023-11-21 22:15:10,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2023-11-21 22:15:10,123 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 80 treesize of output 72 [2023-11-21 22:15:10,141 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 113 treesize of output 105 [2023-11-21 22:15:10,155 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 106 treesize of output 98 [2023-11-21 22:15:10,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:10,341 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 77 treesize of output 81 [2023-11-21 22:15:10,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse24 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse3 (= .cse24 0)) (.cse2 (= .cse8 0))) (and (or (forall ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_DerPreprocessor_36) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) (not .cse2) (not .cse3)) (or (let ((.cse11 (+ .cse24 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse11)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8))) (let ((.cse4 (not .cse13)) (.cse6 (+ .cse7 4)) (.cse10 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse9)) (.cse17 (= .cse9 .cse8))) (and (or (and (or .cse4 (forall ((v_ArrVal_725 (Array Int Int)) (v_arrayElimCell_57 Int)) (not (let ((.cse5 (select (store |c_#memory_$Pointer$#1.base| .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse10 v_arrayElimCell_57 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_725) .cse8) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) .cse12))) (= (select .cse5 .cse6) (select .cse5 .cse7)))))) (or .cse13 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse15 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_DerPreprocessor_42) .cse8 v_DerPreprocessor_43))) (or (not (let ((.cse14 (select .cse15 .cse12))) (= (select .cse14 .cse6) (select .cse14 .cse7)))) (not (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse10 v_arrayElimCell_58 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse15 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) .cse8) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) v_DerPreprocessor_43))))))) (not .cse16)) (or (not .cse17) (and (or .cse4 (forall ((v_ArrVal_725 (Array Int Int)) (v_arrayElimCell_59 Int)) (not (let ((.cse18 (select (store |c_#memory_$Pointer$#1.base| .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse10 v_arrayElimCell_59 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_725) .cse8) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) .cse12))) (= (select .cse18 .cse7) (select .cse18 .cse6)))))) (or .cse13 (forall ((v_arrayElimCell_60 Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_DerPreprocessor_44) .cse8 v_DerPreprocessor_45))) (or (not (let ((.cse19 (select .cse20 .cse12))) (= (select .cse19 .cse7) (select .cse19 .cse6)))) (not (= v_DerPreprocessor_45 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse10 v_arrayElimCell_60 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse20 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) .cse8) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))))))) (or (and (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_arrayElimCell_61 Int) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_38) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_DerPreprocessor_39) .cse8 v_DerPreprocessor_40))) (or (not (let ((.cse21 (select .cse22 .cse12))) (= (select .cse21 .cse6) (select .cse21 .cse7)))) (not (= v_DerPreprocessor_40 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse10 v_arrayElimCell_61 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse22 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) .cse8) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))))) .cse13) (or .cse4 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_725 (Array Int Int))) (not (let ((.cse23 (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_41) .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse10 v_arrayElimCell_62 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_725) .cse8) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) .cse12))) (= (select .cse23 .cse7) (select .cse23 .cse6))))))) .cse16 .cse17))))) (and .cse3 .cse2))))) is different from false [2023-11-21 22:15:10,768 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 108 treesize of output 84 [2023-11-21 22:15:10,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:10,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2023-11-21 22:15:10,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:10,851 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 70 treesize of output 61 [2023-11-21 22:15:10,869 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 16 treesize of output 8 [2023-11-21 22:15:10,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:10,905 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 70 treesize of output 61 [2023-11-21 22:15:10,917 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 16 treesize of output 8 [2023-11-21 22:15:11,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640550690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:11,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:15:11,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2023-11-21 22:15:11,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444554046] [2023-11-21 22:15:11,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:15:11,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-21 22:15:11,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:11,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 22:15:11,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=374, Unknown=13, NotChecked=308, Total=756 [2023-11-21 22:15:11,258 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 17 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-21 22:15:11,507 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) is different from false [2023-11-21 22:15:11,509 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (not (= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) is different from true [2023-11-21 22:15:11,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 .cse1) (not .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))) is different from false [2023-11-21 22:15:11,519 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 .cse1) (not .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))) is different from true [2023-11-21 22:15:11,525 WARN L854 $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|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select .cse5 4))) (let ((.cse1 (= .cse3 .cse0)) (.cse2 (= (select .cse5 0) .cse3))) (and (not (= .cse0 0)) (not .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or .cse2 .cse1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2 (not (= .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1))) (= (select |c_#valid| .cse3) 1)))))) is different from false [2023-11-21 22:15:11,528 WARN L876 $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|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select .cse5 4))) (let ((.cse1 (= .cse3 .cse0)) (.cse2 (= (select .cse5 0) .cse3))) (and (not (= .cse0 0)) (not .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or .cse2 .cse1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2 (not (= .cse3 0)) (exists ((|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1))) (= (select |c_#valid| .cse3) 1)))))) is different from true [2023-11-21 22:15:11,544 WARN L854 $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|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select .cse5 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (not (= (select .cse0 4) .cse1)) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_5| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |v_old(#valid)_AFTER_CALL_6| .cse4))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse5 0) .cse3) (not (= .cse3 0)))))) is different from false [2023-11-21 22:15:11,547 WARN L876 $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|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select .cse5 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse0 0))) (not (= (select .cse0 4) .cse1)) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_5| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |v_old(#valid)_AFTER_CALL_6| .cse4))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse5 0) .cse3) (not (= .cse3 0)))))) is different from true [2023-11-21 22:15:11,580 WARN L854 $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|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_arrayElimCell_32 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_22) .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24))) (let ((.cse5 (select .cse2 .cse0))) (let ((.cse3 (select .cse5 4))) (and (= .cse1 (select (select .cse2 .cse3) v_arrayElimCell_32)) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_6| .cse1) 0) (= v_DerPreprocessor_21 .cse3) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |v_old(#valid)_AFTER_CALL_6| .cse4))) |v_old(#valid)_AFTER_CALL_6|) (= (select .cse5 0) .cse3) (not (= .cse3 0)) (= .cse6 (store (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24) .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0) 4 .cse1))))))) (not (= .cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))))) is different from false [2023-11-21 22:15:11,583 WARN L876 $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|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_arrayElimCell_32 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_22) .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24))) (let ((.cse5 (select .cse2 .cse0))) (let ((.cse3 (select .cse5 4))) (and (= .cse1 (select (select .cse2 .cse3) v_arrayElimCell_32)) (= (select |v_old(#valid)_AFTER_CALL_5| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_5| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_6| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_6| .cse1) 0) (= v_DerPreprocessor_21 .cse3) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse4 (select |v_old(#valid)_AFTER_CALL_6| .cse4))) |v_old(#valid)_AFTER_CALL_6|) (= (select .cse5 0) .cse3) (not (= .cse3 0)) (= .cse6 (store (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_23) v_DerPreprocessor_21 v_DerPreprocessor_24) .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse0) 4 .cse1))))))) (not (= .cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0))))) is different from true [2023-11-21 22:15:11,620 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_39 0)) (= (select |v_old(#valid)_AFTER_CALL_5| v_arrayElimCell_39) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |v_old(#valid)_AFTER_CALL_6| .cse0))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) is different from false [2023-11-21 22:15:11,622 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((v_arrayElimCell_39 Int) (|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_6| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (not (= v_arrayElimCell_39 0)) (= (select |v_old(#valid)_AFTER_CALL_5| v_arrayElimCell_39) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_5| |v_old(#valid)_AFTER_CALL_6|))) (store |v_old(#valid)_AFTER_CALL_5| .cse0 (select |v_old(#valid)_AFTER_CALL_6| .cse0))) |v_old(#valid)_AFTER_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_6| v_arrayElimCell_39) 1) (= (select |v_old(#valid)_AFTER_CALL_5| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) is different from true [2023-11-21 22:15:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:15:11,955 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-11-21 22:15:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:15:11,957 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 1.35) internal successors, (27), 17 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-11-21 22:15:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:15:11,958 INFO L225 Difference]: With dead ends: 35 [2023-11-21 22:15:11,958 INFO L226 Difference]: Without dead ends: 30 [2023-11-21 22:15:11,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=448, Unknown=25, NotChecked=702, Total=1260 [2023-11-21 22:15:11,960 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:15:11,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 363 Unchecked, 0.5s Time] [2023-11-21 22:15:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-21 22:15:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-21 22:15:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:15:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2023-11-21 22:15:11,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 24 [2023-11-21 22:15:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:15:11,972 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-21 22:15:11,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 1.35) internal successors, (27), 17 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-21 22:15:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2023-11-21 22:15:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 22:15:11,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:15:11,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:11,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:15:12,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:12,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:15:12,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 77182432, now seen corresponding path program 1 times [2023-11-21 22:15:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:12,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163878473] [2023-11-21 22:15:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:12,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 22:15:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 22:15:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:15,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:15:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:15:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163878473] [2023-11-21 22:15:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163878473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112718364] [2023-11-21 22:15:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:16,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:16,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:15:16,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2957e3-941f-477c-aec6-6711cc687b2b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:15:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:16,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 150 conjunts are in the unsatisfiable core [2023-11-21 22:15:16,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:15:16,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:15:16,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:15:17,005 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:15:17,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-21 22:15:17,038 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:15:17,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 22:15:17,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-21 22:15:17,155 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 16 treesize of output 11 [2023-11-21 22:15:17,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:17,167 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 26 treesize of output 23 [2023-11-21 22:15:17,173 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 [2023-11-21 22:15:17,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-21 22:15:17,195 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 16 treesize of output 11 [2023-11-21 22:15:17,368 INFO L349 Elim1Store]: treesize reduction 166, result has 19.8 percent of original size [2023-11-21 22:15:17,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 402 treesize of output 193 [2023-11-21 22:15:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:17,382 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 70 treesize of output 59 [2023-11-21 22:15:17,390 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 19 [2023-11-21 22:15:17,414 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 143 treesize of output 70 [2023-11-21 22:15:17,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:17,421 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 70 treesize of output 23 [2023-11-21 22:15:17,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:17,854 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-21 22:15:17,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 112 [2023-11-21 22:15:17,879 INFO L349 Elim1Store]: treesize reduction 37, result has 47.1 percent of original size [2023-11-21 22:15:17,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2023-11-21 22:15:17,922 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-21 22:15:17,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-21 22:15:17,939 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 78 treesize of output 61 [2023-11-21 22:15:18,272 INFO L349 Elim1Store]: treesize reduction 289, result has 4.3 percent of original size [2023-11-21 22:15:18,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 511 treesize of output 408 [2023-11-21 22:15:18,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,303 INFO L349 Elim1Store]: treesize reduction 119, result has 0.8 percent of original size [2023-11-21 22:15:18,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 638 treesize of output 449 [2023-11-21 22:15:18,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 269 [2023-11-21 22:15:18,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2023-11-21 22:15:18,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2023-11-21 22:15:18,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 56 [2023-11-21 22:15:18,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-11-21 22:15:18,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-21 22:15:18,428 INFO L349 Elim1Store]: treesize reduction 258, result has 0.4 percent of original size [2023-11-21 22:15:18,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 394 treesize of output 342 [2023-11-21 22:15:18,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:15:18,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 679 treesize of output 465 [2023-11-21 22:15:18,639 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 180 treesize of output 128 [2023-11-21 22:15:18,643 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 124 treesize of output 84 [2023-11-21 22:15:18,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 30 [2023-11-21 22:15:18,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:18,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2023-11-21 22:15:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:18,848 INFO L327 TraceCheckSpWp]: Computing backward predicates...