./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX --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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:05:45,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:05:45,979 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:05:45,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:05:45,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:05:46,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:05:46,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:05:46,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:05:46,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:05:46,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:05:46,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:05:46,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:05:46,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:05:46,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:05:46,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:05:46,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:05:46,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:05:46,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:05:46,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:05:46,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:05:46,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:05:46,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:05:46,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:05:46,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:05:46,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:05:46,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:05:46,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:05:46,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:05:46,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:05:46,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:05:46,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:05:46,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:05:46,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:05:46,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:05:46,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:05:46,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:05:46,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:05:46,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:05:46,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:05:46,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:05:46,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:05:46,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:05:46,060 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_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/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_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2024-11-08 16:05:46,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:05:46,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:05:46,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:05:46,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:05:46,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:05:46,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i Unable to find full path for "g++" [2024-11-08 16:05:48,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:05:48,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:05:48,810 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-11-08 16:05:48,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/data/a7680fcee/4d21e0efbf06478f8e24aaad16cb6931/FLAGc8a062ea7 [2024-11-08 16:05:49,088 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/data/a7680fcee/4d21e0efbf06478f8e24aaad16cb6931 [2024-11-08 16:05:49,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:05:49,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:05:49,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:05:49,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:05:49,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:05:49,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6476da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49, skipping insertion in model container [2024-11-08 16:05:49,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:05:49,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-11-08 16:05:49,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:05:49,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:05:49,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-11-08 16:05:49,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:05:49,790 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:05:49,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49 WrapperNode [2024-11-08 16:05:49,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:05:49,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:05:49,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:05:49,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:05:49,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,852 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-08 16:05:49,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:05:49,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:05:49,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:05:49,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:05:49,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,922 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2024-11-08 16:05:49,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:05:49,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:05:49,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:05:49,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:05:49,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (1/1) ... [2024-11-08 16:05:49,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:05:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:05:49,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:05:50,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:05:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:05:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:05:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:05:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:05:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:05:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:05:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 16:05:50,041 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 16:05:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 16:05:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:05:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:05:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 16:05:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 16:05:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 16:05:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 16:05:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 16:05:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 16:05:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:05:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 16:05:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 16:05:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 16:05:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:05:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:05:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:05:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:05:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:05:50,226 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:05:50,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:05:50,549 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-08 16:05:50,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:05:50,564 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:05:50,565 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 16:05:50,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:50 BoogieIcfgContainer [2024-11-08 16:05:50,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:05:50,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:05:50,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:05:50,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:05:50,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:05:49" (1/3) ... [2024-11-08 16:05:50,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7654327c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:05:50, skipping insertion in model container [2024-11-08 16:05:50,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:49" (2/3) ... [2024-11-08 16:05:50,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7654327c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:05:50, skipping insertion in model container [2024-11-08 16:05:50,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:50" (3/3) ... [2024-11-08 16:05:50,583 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2024-11-08 16:05:50,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:05:50,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:05:50,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:05:50,708 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f841921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:05:50,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:05:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 16:05:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 16:05:50,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:50,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:50,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2072084495, now seen corresponding path program 1 times [2024-11-08 16:05:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707655894] [2024-11-08 16:05:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:05:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 16:05:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 16:05:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707655894] [2024-11-08 16:05:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707655894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:05:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716395102] [2024-11-08 16:05:51,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:05:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:05:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:05:51,554 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 16:05:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:51,684 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2024-11-08 16:05:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:05:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2024-11-08 16:05:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:51,696 INFO L225 Difference]: With dead ends: 70 [2024-11-08 16:05:51,696 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 16:05:51,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:05:51,704 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:51,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 109 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:05:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 16:05:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-08 16:05:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 16:05:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-08 16:05:51,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2024-11-08 16:05:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:51,750 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-08 16:05:51,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 16:05:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-08 16:05:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 16:05:51,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:51,753 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:51,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:05:51,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:51,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1248248496, now seen corresponding path program 1 times [2024-11-08 16:05:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863125463] [2024-11-08 16:05:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:52,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:05:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:05:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:52,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:05:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 16:05:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863125463] [2024-11-08 16:05:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863125463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:05:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557192623] [2024-11-08 16:05:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:05:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:05:52,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:05:52,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:05:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:52,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 16:05:52,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:53,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 16:05:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:05:53,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:05:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 16:05:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557192623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:05:53,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:05:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-08 16:05:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460899873] [2024-11-08 16:05:53,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:05:53,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:05:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:05:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:05:53,249 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 16:05:57,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:01,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:05,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:09,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:13,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:17,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:17,711 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-08 16:06:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:06:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-08 16:06:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:17,713 INFO L225 Difference]: With dead ends: 44 [2024-11-08 16:06:17,713 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 16:06:17,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:06:17,715 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:17,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2024-11-08 16:06:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 16:06:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-08 16:06:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 16:06:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-08 16:06:17,727 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 33 [2024-11-08 16:06:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-08 16:06:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 16:06:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-08 16:06:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 16:06:17,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:17,732 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:06:17,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:06:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:17,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1215793702, now seen corresponding path program 1 times [2024-11-08 16:06:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613747341] [2024-11-08 16:06:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:06:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:19,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:06:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:19,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 16:06:19,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:19,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613747341] [2024-11-08 16:06:19,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613747341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:19,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224485768] [2024-11-08 16:06:19,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:19,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:19,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:06:19,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:06:19,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:06:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:20,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 16:06:20,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:06:20,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:06:20,486 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 3 [2024-11-08 16:06:20,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 16:06:20,687 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 16:06:20,688 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 15 [2024-11-08 16:06:21,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-08 16:06:21,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-08 16:06:21,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-08 16:06:21,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:06:21,200 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 25 treesize of output 17 [2024-11-08 16:06:21,207 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 21 treesize of output 13 [2024-11-08 16:06:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:06:21,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:06:21,507 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 86 treesize of output 82 [2024-11-08 16:06:21,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse0 (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int) (v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_407) .cse6) (+ 4 v_arrayElimCell_10))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or .cse0 .cse1) (or (not .cse2) (not .cse1) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_407) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4)))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int)) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_407))) (or (forall ((v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse6) (+ 4 v_arrayElimCell_10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4))))) (or .cse0 .cse2)))) is different from false [2024-11-08 16:06:21,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse7 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int) (v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_405)) .cse7 v_ArrVal_407) .cse3) (+ 4 v_arrayElimCell_10))))) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (and (or .cse0 .cse1) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int)) (let ((.cse2 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_405)) .cse7 v_ArrVal_407))) (or (forall ((v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse3) (+ 4 v_arrayElimCell_10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse5))))) (or .cse8 .cse0) (or (not .cse8) (not .cse1) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_405)) .cse7 v_ArrVal_407) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse5)))))))) is different from false [2024-11-08 16:06:21,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int) (v_arrayElimCell_10 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_405)) .cse4 v_ArrVal_407) .cse7) (+ 4 v_arrayElimCell_10)) |c_ULTIMATE.start_main_~data~0#1|)))) (and (or .cse0 .cse1) (or (not .cse0) (not .cse2) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_405)) .cse4 v_ArrVal_407) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse5)))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_405 Int)) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_405)) .cse4 v_ArrVal_407))) (or (forall ((v_arrayElimCell_10 Int)) (= (select (select .cse6 .cse7) (+ 4 v_arrayElimCell_10)) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse5))))) (or .cse2 .cse1))))) is different from false [2024-11-08 16:06:22,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:22,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 188 treesize of output 250 [2024-11-08 16:06:22,297 INFO L349 Elim1Store]: treesize reduction 305, result has 22.8 percent of original size [2024-11-08 16:06:22,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 443 [2024-11-08 16:06:22,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:22,343 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 336 treesize of output 329 [2024-11-08 16:06:22,464 INFO L349 Elim1Store]: treesize reduction 103, result has 38.3 percent of original size [2024-11-08 16:06:22,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 432 treesize of output 462 [2024-11-08 16:06:22,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:22,514 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 344 treesize of output 340 [2024-11-08 16:06:22,557 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 327 treesize of output 323 [2024-11-08 16:06:22,585 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 323 treesize of output 319 [2024-11-08 16:06:22,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:22,628 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 374 treesize of output 372 [2024-11-08 16:06:22,658 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 338 treesize of output 334 [2024-11-08 16:06:23,132 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 8 treesize of output 4 [2024-11-08 16:06:23,474 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 8 treesize of output 4 [2024-11-08 16:06:23,505 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 125 treesize of output 117 [2024-11-08 16:06:23,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:23,678 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 86 treesize of output 86 [2024-11-08 16:06:23,991 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 16:06:24,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:24,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 187 treesize of output 371 [2024-11-08 16:06:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224485768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:25,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:06:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-08 16:06:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031927550] [2024-11-08 16:06:25,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:06:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 16:06:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 16:06:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1173, Unknown=3, NotChecked=210, Total=1482 [2024-11-08 16:06:25,406 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 32 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 26 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 16:06:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:26,665 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-11-08 16:06:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 16:06:26,666 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 26 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2024-11-08 16:06:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:26,669 INFO L225 Difference]: With dead ends: 72 [2024-11-08 16:06:26,669 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 16:06:26,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=185, Invalid=2274, Unknown=3, NotChecked=294, Total=2756 [2024-11-08 16:06:26,671 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:26,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 511 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:06:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 16:06:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2024-11-08 16:06:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 16:06:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-11-08 16:06:26,684 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 36 [2024-11-08 16:06:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:26,684 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-11-08 16:06:26,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 26 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 16:06:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-11-08 16:06:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 16:06:26,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:26,686 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:06:26,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:06:26,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:26,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:26,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash -295121727, now seen corresponding path program 1 times [2024-11-08 16:06:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:26,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997244149] [2024-11-08 16:06:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:06:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:06:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 16:06:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997244149] [2024-11-08 16:06:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997244149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:29,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260909973] [2024-11-08 16:06:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:29,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:29,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:06:29,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:06:29,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:06:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:29,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-08 16:06:29,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:06:29,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:06:30,377 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:06:30,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 16:06:30,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:06:30,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:06:30,672 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:06:30,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-08 16:06:30,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 16:06:30,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 16:06:30,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 16:06:30,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 16:06:31,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:06:31,425 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 16:06:31,426 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 [2024-11-08 16:06:31,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:06:31,468 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 48 treesize of output 32 [2024-11-08 16:06:31,503 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 16:06:31,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 16:06:32,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:32,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:32,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-08 16:06:32,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:32,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:32,635 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-08 16:06:32,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 22 [2024-11-08 16:06:33,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-08 16:06:33,063 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 20 treesize of output 15 [2024-11-08 16:06:33,089 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 16:06:33,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 16:06:33,132 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-08 16:06:33,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2024-11-08 16:06:33,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:06:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:06:33,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:06:34,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:34,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 76 [2024-11-08 16:06:34,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:34,531 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 140 treesize of output 141 [2024-11-08 16:06:34,543 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 58 treesize of output 42 [2024-11-08 16:06:35,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260909973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:35,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:06:35,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2024-11-08 16:06:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225069496] [2024-11-08 16:06:35,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:06:35,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 16:06:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 16:06:35,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2762, Unknown=12, NotChecked=0, Total=2970 [2024-11-08 16:06:35,022 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 46 states, 43 states have (on average 1.372093023255814) internal successors, (59), 37 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:06:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:38,153 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2024-11-08 16:06:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 16:06:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.372093023255814) internal successors, (59), 37 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-11-08 16:06:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:38,155 INFO L225 Difference]: With dead ends: 96 [2024-11-08 16:06:38,156 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 16:06:38,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=437, Invalid=5403, Unknown=12, NotChecked=0, Total=5852 [2024-11-08 16:06:38,158 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:38,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 445 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 16:06:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 16:06:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2024-11-08 16:06:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:06:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2024-11-08 16:06:38,190 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 38 [2024-11-08 16:06:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:38,191 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2024-11-08 16:06:38,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.372093023255814) internal successors, (59), 37 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:06:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2024-11-08 16:06:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 16:06:38,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:38,193 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:06:38,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:06:38,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 16:06:38,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:38,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash -144107241, now seen corresponding path program 1 times [2024-11-08 16:06:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857869383] [2024-11-08 16:06:38,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:06:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:06:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 16:06:39,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:39,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857869383] [2024-11-08 16:06:39,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857869383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548748839] [2024-11-08 16:06:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:39,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:06:39,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:06:39,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:06:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:39,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-08 16:06:39,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:06:40,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:06:40,252 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 15 treesize of output 1 [2024-11-08 16:06:40,342 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-08 16:06:40,343 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 23 treesize of output 15 [2024-11-08 16:06:40,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 16:06:40,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 16:06:40,653 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 18 treesize of output 7 [2024-11-08 16:06:40,786 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 16:06:40,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 16:06:40,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 16:06:41,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:41,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:41,282 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-08 16:06:41,885 INFO L349 Elim1Store]: treesize reduction 129, result has 28.7 percent of original size [2024-11-08 16:06:41,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 62 [2024-11-08 16:06:41,944 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-08 16:06:41,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 59 [2024-11-08 16:06:41,989 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-08 16:06:41,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-08 16:06:42,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2024-11-08 16:06:42,271 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 62 treesize of output 38 [2024-11-08 16:06:42,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:42,283 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 35 treesize of output 27 [2024-11-08 16:06:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:06:42,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:06:43,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:06:43,517 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 1726 treesize of output 1729 [2024-11-08 16:06:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548748839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:46,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:06:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2024-11-08 16:06:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302229471] [2024-11-08 16:06:46,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:06:46,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 16:06:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 16:06:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2110, Unknown=1, NotChecked=0, Total=2256 [2024-11-08 16:06:46,826 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 41 states, 39 states have (on average 1.641025641025641) internal successors, (64), 34 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 16:06:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:49,348 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2024-11-08 16:06:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 16:06:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.641025641025641) internal successors, (64), 34 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-08 16:06:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:49,350 INFO L225 Difference]: With dead ends: 94 [2024-11-08 16:06:49,350 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 16:06:49,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=340, Invalid=4081, Unknown=1, NotChecked=0, Total=4422 [2024-11-08 16:06:49,352 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:49,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 569 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:06:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 16:06:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2024-11-08 16:06:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:06:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2024-11-08 16:06:49,370 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 40 [2024-11-08 16:06:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2024-11-08 16:06:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.641025641025641) internal successors, (64), 34 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 16:06:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2024-11-08 16:06:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 16:06:49,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:49,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:06:49,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:06:49,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:49,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -585902948, now seen corresponding path program 2 times [2024-11-08 16:06:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916773648] [2024-11-08 16:06:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:06:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:06:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 16:06:51,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:51,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916773648] [2024-11-08 16:06:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916773648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:06:51,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756598896] [2024-11-08 16:06:51,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:06:51,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:06:51,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:06:51,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:06:51,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08efbf61-6ba4-49fe-b3cc-a17c2f19a54c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:06:52,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:06:52,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:06:52,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-08 16:06:52,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:06:52,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:06:52,434 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-08 16:06:52,437 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-08 16:06:52,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:06:52,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:06:52,518 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2024-11-08 16:06:52,521 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2024-11-08 16:06:52,595 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 16:06:52,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2024-11-08 16:06:52,617 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-08 16:06:52,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-08 16:06:52,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from false [2024-11-08 16:06:52,649 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from true [2024-11-08 16:06:52,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 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) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1)))) is different from false [2024-11-08 16:06:52,731 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 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) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1)))) is different from true [2024-11-08 16:06:52,759 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:06:52,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2024-11-08 16:06:52,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 16:06:52,800 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))))) is different from false [2024-11-08 16:06:52,804 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))))) is different from true [2024-11-08 16:06:52,853 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))))) is different from false [2024-11-08 16:06:52,857 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))))) is different from true [2024-11-08 16:06:52,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:06:52,968 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 4)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))))) is different from false [2024-11-08 16:06:52,972 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 4)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1))))) is different from true [2024-11-08 16:06:53,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:06:53,108 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 16:06:53,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 57 [2024-11-08 16:06:53,138 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 16:06:53,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-11-08 16:06:53,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .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) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse2)))) is different from false [2024-11-08 16:06:53,221 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .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) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 0) .cse2)))) is different from true [2024-11-08 16:06:53,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-11-08 16:06:53,350 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-11-08 16:06:53,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-11-08 16:06:53,490 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-11-08 16:06:53,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:53,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:53,704 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-08 16:06:53,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-11-08 16:06:53,803 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-11-08 16:06:54,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse0 (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23| Int)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select .cse2 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23|))))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select .cse2 0) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (and .cse0 (= .cse3 .cse1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-11-08 16:06:54,094 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse0 (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23| Int)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select .cse2 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_23|))))) (or (and .cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select .cse2 0) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (and .cse0 (= .cse3 .cse1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-11-08 16:06:54,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:54,181 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:06:54,272 INFO L349 Elim1Store]: treesize reduction 149, result has 21.2 percent of original size [2024-11-08 16:06:54,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 122 treesize of output 87 [2024-11-08 16:06:54,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))) is different from false [2024-11-08 16:06:54,394 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))) is different from true [2024-11-08 16:06:54,536 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))) is different from false [2024-11-08 16:06:54,541 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))) is different from true [2024-11-08 16:06:54,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-08 16:06:54,723 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-08 16:06:54,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 56 [2024-11-08 16:06:54,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:06:54,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 16:06:54,782 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 16:06:54,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 16:06:59,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_int#1| .cse0) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse5 (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimCell_101 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse11 (select |v_old(#valid)_AFTER_CALL_15| .cse11))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_101) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_101) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))))) (or (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int)) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (exists ((v_arrayElimCell_102 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_102) 1) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_102) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_102)) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_102) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))))))) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) .cse5) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1)))) .cse5) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int)) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse9 (select |v_old(#valid)_AFTER_CALL_15| .cse9))) |v_old(#valid)_AFTER_CALL_15|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1)))))))))))) is different from false [2024-11-08 16:06:59,655 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_int#1| .cse0) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse5 (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimCell_101 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse11 (select |v_old(#valid)_AFTER_CALL_15| .cse11))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_101) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_101) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))))) (or (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int)) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (exists ((v_arrayElimCell_102 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_102) 1) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_102) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_102)) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_102) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1))))))) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1)))) .cse5) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1)))) .cse5) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int)) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_15|))) (store |v_#valid_BEFORE_CALL_13| .cse9 (select |v_old(#valid)_AFTER_CALL_15| .cse9))) |v_old(#valid)_AFTER_CALL_15|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_6) 1)))))))))))) is different from true [2024-11-08 16:07:00,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:07:00,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 353 [2024-11-08 16:07:00,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:07:00,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 334