./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 0e0057cc 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_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:16:04,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:16:04,287 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:16:04,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:16:04,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:16:04,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:16:04,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:16:04,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:16:04,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:16:04,316 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:16:04,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:16:04,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:16:04,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:16:04,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:16:04,318 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:16:04,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:16:04,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:16:04,320 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:16:04,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:16:04,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:16:04,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:16:04,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:16:04,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:16:04,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:16:04,325 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:16:04,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:16:04,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:16:04,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:16:04,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:16:04,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:16:04,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:16:04,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:16:04,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:16:04,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:16:04,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:16:04,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:16:04,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:16:04,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:16:04,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:16:04,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:16:04,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:16:04,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:16:04,330 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_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-29 05:16:04,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:16:04,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:16:04,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:16:04,580 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:16:04,581 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:16:04,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 05:16:07,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:16:07,570 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:16:07,571 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 05:16:07,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data/da82abdfe/0a199ee1fec64f5ab3fc1ea8ea0f3370/FLAG997cbd90c [2023-11-29 05:16:07,595 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data/da82abdfe/0a199ee1fec64f5ab3fc1ea8ea0f3370 [2023-11-29 05:16:07,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:16:07,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:16:07,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:16:07,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:16:07,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:16:07,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:07,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aabf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07, skipping insertion in model container [2023-11-29 05:16:07,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:07,652 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:16:07,920 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-29 05:16:07,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:16:07,934 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:16:07,972 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-29 05:16:07,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:16:07,999 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:16:07,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07 WrapperNode [2023-11-29 05:16:07,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:16:08,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:16:08,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:16:08,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:16:08,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,040 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-11-29 05:16:08,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:16:08,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:16:08,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:16:08,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:16:08,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,082 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]. [2023-11-29 05:16:08,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:16:08,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:16:08,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:16:08,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:16:08,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (1/1) ... [2023-11-29 05:16:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:16:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:08,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:16:08,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:16:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:16:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:16:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:16:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:16:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:16:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:16:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:16:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:16:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:16:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:16:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:16:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:16:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:16:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:16:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:16:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:16:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:16:08,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:16:08,292 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:16:08,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:16:08,511 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:16:08,545 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:16:08,545 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:16:08,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:16:08 BoogieIcfgContainer [2023-11-29 05:16:08,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:16:08,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:16:08,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:16:08,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:16:08,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:16:07" (1/3) ... [2023-11-29 05:16:08,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15973ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:16:08, skipping insertion in model container [2023-11-29 05:16:08,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:16:07" (2/3) ... [2023-11-29 05:16:08,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15973ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:16:08, skipping insertion in model container [2023-11-29 05:16:08,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:16:08" (3/3) ... [2023-11-29 05:16:08,555 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-29 05:16:08,570 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:16:08,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:16:08,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:16:08,626 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a8d77b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:16:08,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:16:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:16:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:16:08,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:08,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:08,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:08,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2023-11-29 05:16:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27510300] [2023-11-29 05:16:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:16:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:16:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:16:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27510300] [2023-11-29 05:16:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27510300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:16:08,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970139406] [2023-11-29 05:16:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:16:08,979 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:16:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:09,047 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-11-29 05:16:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:09,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2023-11-29 05:16:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:09,054 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:16:09,055 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 05:16:09,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:16:09,062 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:09,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 05:16:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 05:16:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:16:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-29 05:16:09,101 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-11-29 05:16:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:09,103 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-29 05:16:09,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:16:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-29 05:16:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:16:09,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:09,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:09,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:16:09,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:09,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2023-11-29 05:16:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437006396] [2023-11-29 05:16:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:16:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:16:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:16:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437006396] [2023-11-29 05:16:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437006396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:16:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651969986] [2023-11-29 05:16:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:16:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:16:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:16:09,303 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:16:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:09,365 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-11-29 05:16:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:16:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2023-11-29 05:16:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:09,367 INFO L225 Difference]: With dead ends: 43 [2023-11-29 05:16:09,368 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 05:16:09,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:16:09,369 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:09,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:16:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 05:16:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-29 05:16:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:16:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 05:16:09,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2023-11-29 05:16:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:09,377 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 05:16:09,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:16:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 05:16:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:16:09,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:09,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:09,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:16:09,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:09,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2023-11-29 05:16:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:09,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443305145] [2023-11-29 05:16:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:16:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:16:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:16:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:16:09,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:09,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443305145] [2023-11-29 05:16:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443305145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157757916] [2023-11-29 05:16:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:09,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:09,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:09,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:09,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:16:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:09,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:16:09,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:10,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 05:16:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:16:10,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:16:10,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 05:16:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:16:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157757916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:16:10,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:16:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-11-29 05:16:10,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354504626] [2023-11-29 05:16:10,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:16:10,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:16:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:10,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:16:10,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:16:10,317 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 05:16:14,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:18,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:22,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:26,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:30,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:34,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:34,641 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-11-29 05:16:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:16:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 24 [2023-11-29 05:16:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:34,642 INFO L225 Difference]: With dead ends: 36 [2023-11-29 05:16:34,642 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:16:34,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:16:34,644 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:34,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2023-11-29 05:16:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:16:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-29 05:16:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:16:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-29 05:16:34,650 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-11-29 05:16:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:34,651 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-29 05:16:34,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 05:16:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-29 05:16:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:16:34,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:34,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:34,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:16:34,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:34,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:34,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2023-11-29 05:16:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163614114] [2023-11-29 05:16:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:16:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:16:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:16:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:16:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163614114] [2023-11-29 05:16:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163614114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957481622] [2023-11-29 05:16:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:36,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:36,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:16:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:36,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 05:16:36,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:36,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:16:36,402 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:16:36,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:16:36,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:16:36,545 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:16:36,545 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 70 treesize of output 57 [2023-11-29 05:16:36,601 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 38 treesize of output 14 [2023-11-29 05:16:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:16:36,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:36,715 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 46 treesize of output 35 [2023-11-29 05:16:36,734 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-29 05:16:36,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-29 05:16:36,829 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 28 treesize of output 20 [2023-11-29 05:16:36,872 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 35 treesize of output 19 [2023-11-29 05:16:36,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 05:16:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:16:36,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:16:37,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957481622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:37,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:16:37,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 32 [2023-11-29 05:16:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96156519] [2023-11-29 05:16:37,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:16:37,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 05:16:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:37,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 05:16:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 05:16:37,093 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:16:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:37,884 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2023-11-29 05:16:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:16:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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 27 [2023-11-29 05:16:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:37,886 INFO L225 Difference]: With dead ends: 61 [2023-11-29 05:16:37,886 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 05:16:37,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=1847, Unknown=0, NotChecked=0, Total=2070 [2023-11-29 05:16:37,889 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 94 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:37,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 242 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:16:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 05:16:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2023-11-29 05:16:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:16:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2023-11-29 05:16:37,901 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 27 [2023-11-29 05:16:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:37,901 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-11-29 05:16:37,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:16:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2023-11-29 05:16:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:16:37,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:37,903 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:37,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:16:38,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:38,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:38,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2023-11-29 05:16:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:38,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254573428] [2023-11-29 05:16:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:16:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:16:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:16:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:16:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254573428] [2023-11-29 05:16:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254573428] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152992364] [2023-11-29 05:16:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:39,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:39,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:39,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:39,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:16:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:39,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 05:16:39,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:39,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:16:40,023 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-29 05:16:40,026 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-29 05:16:40,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:16:40,055 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-29 05:16:40,057 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from true [2023-11-29 05:16:40,126 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:16:40,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2023-11-29 05:16:40,149 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))))) is different from false [2023-11-29 05:16:40,151 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))))) is different from true [2023-11-29 05:16:40,162 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 17 treesize of output 5 [2023-11-29 05:16:40,176 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 05:16:40,178 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 05:16:40,207 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 05:16:40,209 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 05:16:40,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:16:40,244 WARN L854 $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|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-11-29 05:16:40,246 WARN L876 $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|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-11-29 05:16:40,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:40,295 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 26 treesize of output 21 [2023-11-29 05:16:40,327 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) is different from false [2023-11-29 05:16:40,331 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) is different from true [2023-11-29 05:16:40,420 WARN L854 $PredicateComparison]: unable to prove that (and (= |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.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) is different from false [2023-11-29 05:16:40,424 WARN L876 $PredicateComparison]: unable to prove that (and (= |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.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) is different from true [2023-11-29 05:16:40,508 WARN L854 $PredicateComparison]: unable to prove that (and (= |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.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= |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|) 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) is different from false [2023-11-29 05:16:40,511 WARN L876 $PredicateComparison]: unable to prove that (and (= |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.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= |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|) 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) is different from true [2023-11-29 05:16:40,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:40,610 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-11-29 05:16:40,611 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 33 treesize of output 12 [2023-11-29 05:16:40,653 WARN L854 $PredicateComparison]: unable to prove that (and (= |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.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) is different from false [2023-11-29 05:16:40,656 WARN L876 $PredicateComparison]: unable to prove that (and (= |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.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)) is different from true [2023-11-29 05:16:40,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:16:40,796 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 36 treesize of output 34 [2023-11-29 05:16:40,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:40,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:16:40,839 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-29 05:16:40,840 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 52 treesize of output 40 [2023-11-29 05:16:42,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_24) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0)))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1)))) (= (select (select |c_#memory_int#1| .cse3) 4) 1))) is different from false [2023-11-29 05:16:42,928 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_24) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 0)))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1)))) (= (select (select |c_#memory_int#1| .cse3) 4) 1))) is different from true [2023-11-29 05:16:43,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:43,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 220 [2023-11-29 05:16:43,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 7 treesize of output 3 [2023-11-29 05:16:47,143 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse0 (exists ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_24 Int) (v_prenex_23 (Array Int Int)) (v_prenex_19 Int)) (and (= (select v_prenex_24 v_arrayElimCell_24) 1) (= (select v_prenex_24 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_23 v_arrayElimCell_24) 0) (= (let ((.cse6 (@diff v_prenex_23 v_prenex_24))) (store v_prenex_23 .cse6 (select v_prenex_24 .cse6))) v_prenex_24) (= (select v_prenex_23 v_prenex_19) 1))))) (or .cse0 (exists ((v_arrayElimCell_27 Int)) (and (exists ((v_prenex_31 (Array Int Int)) (v_prenex_25 Int) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 v_prenex_25) 1) (= (select v_prenex_31 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_31 (let ((.cse1 (@diff v_prenex_29 v_prenex_31))) (store v_prenex_29 .cse1 (select v_prenex_31 .cse1)))) (= (select v_prenex_29 v_arrayElimCell_27) 0) (= (select v_prenex_31 v_arrayElimCell_27) 1))) (exists ((v_prenex_28 Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (and (= (let ((.cse2 (@diff v_prenex_27 v_prenex_26))) (store v_prenex_27 .cse2 (select v_prenex_26 .cse2))) v_prenex_26) (= (select v_prenex_27 v_prenex_28) 1) (= (select v_prenex_26 v_arrayElimCell_27) 1) (= (select v_prenex_27 v_arrayElimCell_27) 0))))) (and .cse0 (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 Int)) (and (= (select v_prenex_21 v_prenex_22) 1) (= (select v_prenex_20 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_21 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_20 (let ((.cse3 (@diff v_prenex_21 v_prenex_20))) (store v_prenex_21 .cse3 (select v_prenex_20 .cse3))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_23 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-11-29 05:16:47,154 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse0 (exists ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_24 Int) (v_prenex_23 (Array Int Int)) (v_prenex_19 Int)) (and (= (select v_prenex_24 v_arrayElimCell_24) 1) (= (select v_prenex_24 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_23 v_arrayElimCell_24) 0) (= (let ((.cse6 (@diff v_prenex_23 v_prenex_24))) (store v_prenex_23 .cse6 (select v_prenex_24 .cse6))) v_prenex_24) (= (select v_prenex_23 v_prenex_19) 1))))) (or .cse0 (exists ((v_arrayElimCell_27 Int)) (and (exists ((v_prenex_31 (Array Int Int)) (v_prenex_25 Int) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 v_prenex_25) 1) (= (select v_prenex_31 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_31 (let ((.cse1 (@diff v_prenex_29 v_prenex_31))) (store v_prenex_29 .cse1 (select v_prenex_31 .cse1)))) (= (select v_prenex_29 v_arrayElimCell_27) 0) (= (select v_prenex_31 v_arrayElimCell_27) 1))) (exists ((v_prenex_28 Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (and (= (let ((.cse2 (@diff v_prenex_27 v_prenex_26))) (store v_prenex_27 .cse2 (select v_prenex_26 .cse2))) v_prenex_26) (= (select v_prenex_27 v_prenex_28) 1) (= (select v_prenex_26 v_arrayElimCell_27) 1) (= (select v_prenex_27 v_arrayElimCell_27) 0))))) (and .cse0 (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 Int)) (and (= (select v_prenex_21 v_prenex_22) 1) (= (select v_prenex_20 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_21 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_20 (let ((.cse3 (@diff v_prenex_21 v_prenex_20))) (store v_prenex_21 .cse3 (select v_prenex_20 .cse3))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_23 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-11-29 05:16:51,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:16:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:16:51,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:16:51,592 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 Int) (v_ArrVal_664 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_658)) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_664) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |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|))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-11-29 05:16:51,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:51,813 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 62 treesize of output 68 [2023-11-29 05:16:51,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:51,827 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 124 treesize of output 125 [2023-11-29 05:16:51,833 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 50 treesize of output 34 [2023-11-29 05:16:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152992364] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:52,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:16:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 38 [2023-11-29 05:16:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453234456] [2023-11-29 05:16:52,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:16:52,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 05:16:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:52,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 05:16:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=888, Unknown=55, NotChecked=936, Total=1980 [2023-11-29 05:16:52,034 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 38 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 29 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:16:52,227 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-29 05:16:52,229 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-29 05:16:52,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1))) is different from false [2023-11-29 05:16:52,234 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1))) is different from true [2023-11-29 05:16:52,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (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|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |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_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#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_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse2) (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|))) 1) (= (select |c_#valid| .cse2) 1))) is different from false [2023-11-29 05:16:52,242 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (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|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |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_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#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_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse2) (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|))) 1) (= (select |c_#valid| .cse2) 1))) is different from true [2023-11-29 05:16:52,248 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-29 05:16:52,250 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-29 05:16:52,254 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 05:16:52,256 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 05:16:52,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_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)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |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_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2023-11-29 05:16:52,272 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_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)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |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_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2023-11-29 05:16:52,283 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4))) (and (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse2) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#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|)))) (= |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_main_~data~0#1| .cse0) (= |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_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))) is different from false [2023-11-29 05:16:52,287 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4))) (and (= .cse0 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse2) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#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|)))) (= |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_main_~data~0#1| .cse0) (= |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_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))) is different from true [2023-11-29 05:16:52,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) (and (= |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) (not (= (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_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 1))) is different from false [2023-11-29 05:16:52,304 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) (and (= |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) (not (= (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_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 1))) is different from true [2023-11-29 05:16:52,317 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (= |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) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= |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|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 1))) is different from false [2023-11-29 05:16:52,321 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (= |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) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3))))) (= |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|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 1))) is different from true [2023-11-29 05:16:52,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) (and (= |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) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse4))))) (= .cse2 1))) is different from false [2023-11-29 05:16:52,338 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) (and (= |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) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse4))))) (= .cse2 1))) is different from true [2023-11-29 05:16:53,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse1 0))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4)) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_24) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0)))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1)))) (= (select (select |c_#memory_int#1| .cse5) 4) 1)))) is different from false [2023-11-29 05:16:53,847 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select .cse1 0))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4)) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_24) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0)))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10)))))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1)))) (= (select (select |c_#memory_int#1| .cse5) 4) 1)))) is different from true [2023-11-29 05:16:56,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse0 (exists ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_24 Int) (v_prenex_23 (Array Int Int)) (v_prenex_19 Int)) (and (= (select v_prenex_24 v_arrayElimCell_24) 1) (= (select v_prenex_24 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_23 v_arrayElimCell_24) 0) (= (let ((.cse6 (@diff v_prenex_23 v_prenex_24))) (store v_prenex_23 .cse6 (select v_prenex_24 .cse6))) v_prenex_24) (= (select v_prenex_23 v_prenex_19) 1))))) (or .cse0 (exists ((v_arrayElimCell_27 Int)) (and (exists ((v_prenex_31 (Array Int Int)) (v_prenex_25 Int) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 v_prenex_25) 1) (= (select v_prenex_31 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_31 (let ((.cse1 (@diff v_prenex_29 v_prenex_31))) (store v_prenex_29 .cse1 (select v_prenex_31 .cse1)))) (= (select v_prenex_29 v_arrayElimCell_27) 0) (= (select v_prenex_31 v_arrayElimCell_27) 1))) (exists ((v_prenex_28 Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (and (= (let ((.cse2 (@diff v_prenex_27 v_prenex_26))) (store v_prenex_27 .cse2 (select v_prenex_26 .cse2))) v_prenex_26) (= (select v_prenex_27 v_prenex_28) 1) (= (select v_prenex_26 v_arrayElimCell_27) 1) (= (select v_prenex_27 v_arrayElimCell_27) 0))))) (and .cse0 (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 Int)) (and (= (select v_prenex_21 v_prenex_22) 1) (= (select v_prenex_20 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_21 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_20 (let ((.cse3 (@diff v_prenex_21 v_prenex_20))) (store v_prenex_21 .cse3 (select v_prenex_20 .cse3))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_23 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))))) (= .cse7 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse7))) is different from false [2023-11-29 05:16:56,485 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse0 (exists ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_24 Int) (v_prenex_23 (Array Int Int)) (v_prenex_19 Int)) (and (= (select v_prenex_24 v_arrayElimCell_24) 1) (= (select v_prenex_24 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_23 v_arrayElimCell_24) 0) (= (let ((.cse6 (@diff v_prenex_23 v_prenex_24))) (store v_prenex_23 .cse6 (select v_prenex_24 .cse6))) v_prenex_24) (= (select v_prenex_23 v_prenex_19) 1))))) (or .cse0 (exists ((v_arrayElimCell_27 Int)) (and (exists ((v_prenex_31 (Array Int Int)) (v_prenex_25 Int) (v_prenex_29 (Array Int Int))) (and (= (select v_prenex_29 v_prenex_25) 1) (= (select v_prenex_31 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_31 (let ((.cse1 (@diff v_prenex_29 v_prenex_31))) (store v_prenex_29 .cse1 (select v_prenex_31 .cse1)))) (= (select v_prenex_29 v_arrayElimCell_27) 0) (= (select v_prenex_31 v_arrayElimCell_27) 1))) (exists ((v_prenex_28 Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (and (= (let ((.cse2 (@diff v_prenex_27 v_prenex_26))) (store v_prenex_27 .cse2 (select v_prenex_26 .cse2))) v_prenex_26) (= (select v_prenex_27 v_prenex_28) 1) (= (select v_prenex_26 v_arrayElimCell_27) 1) (= (select v_prenex_27 v_arrayElimCell_27) 0))))) (and .cse0 (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 Int)) (and (= (select v_prenex_21 v_prenex_22) 1) (= (select v_prenex_20 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_21 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_20 (let ((.cse3 (@diff v_prenex_21 v_prenex_20))) (store v_prenex_21 .cse3 (select v_prenex_20 .cse3))))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_17 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (v_arrayElimCell_23 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_16|) 1) (= (select |v_#valid_BEFORE_CALL_7| v_arrayElimCell_23) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_23) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))))) (= .cse7 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse7))) is different from true [2023-11-29 05:16:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:56,610 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-11-29 05:16:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 05:16:56,612 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 29 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-11-29 05:16:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:56,614 INFO L225 Difference]: With dead ends: 56 [2023-11-29 05:16:56,614 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 05:16:56,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=137, Invalid=1006, Unknown=79, NotChecked=2200, Total=3422 [2023-11-29 05:16:56,617 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1013 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:56,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 295 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 1013 Unchecked, 0.2s Time] [2023-11-29 05:16:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 05:16:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 05:16:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 05:16:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-11-29 05:16:56,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 29 [2023-11-29 05:16:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:56,639 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-11-29 05:16:56,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 29 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:16:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-11-29 05:16:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:16:56,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:56,641 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:16:56,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:16:56,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:56,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:56,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2023-11-29 05:16:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440022739] [2023-11-29 05:16:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:16:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:58,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:16:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:16:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:16:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440022739] [2023-11-29 05:16:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440022739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091908464] [2023-11-29 05:16:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:58,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:58,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:58,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:58,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:16:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:58,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-29 05:16:58,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:58,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:16:58,693 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 [2023-11-29 05:16:58,798 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 [2023-11-29 05:16:58,878 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:16:58,879 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 [2023-11-29 05:16:59,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:16:59,395 INFO L349 Elim1Store]: treesize reduction 43, result has 40.3 percent of original size [2023-11-29 05:16:59,395 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 78 treesize of output 39 [2023-11-29 05:16:59,419 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-29 05:16:59,420 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 59 treesize of output 47 [2023-11-29 05:16:59,437 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:16:59,437 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 [2023-11-29 05:16:59,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:16:59,570 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 47 treesize of output 27 [2023-11-29 05:16:59,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:16:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:16:59,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:16:59,985 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 97 treesize of output 89 [2023-11-29 05:17:00,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:00,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1517 treesize of output 1488 [2023-11-29 05:17:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091908464] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:00,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:17:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2023-11-29 05:17:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706756241] [2023-11-29 05:17:00,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:17:00,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 05:17:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:00,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 05:17:00,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 05:17:00,745 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 36 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:17:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:01,779 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2023-11-29 05:17:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:17:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2023-11-29 05:17:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:01,781 INFO L225 Difference]: With dead ends: 64 [2023-11-29 05:17:01,781 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 05:17:01,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=246, Invalid=2616, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 05:17:01,783 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:01,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:17:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 05:17:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-29 05:17:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 05:17:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-29 05:17:01,797 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 31 [2023-11-29 05:17:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:01,798 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-29 05:17:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:17:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-29 05:17:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:17:01,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:01,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:01,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:17:02,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:02,000 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:02,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2023-11-29 05:17:02,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:02,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733916096] [2023-11-29 05:17:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:02,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:17:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:17:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:17:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733916096] [2023-11-29 05:17:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733916096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059123902] [2023-11-29 05:17:03,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:17:03,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:03,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:03,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:17:03,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:17:03,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:17:03,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-29 05:17:03,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:03,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:17:03,563 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 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 [2023-11-29 05:17:03,565 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 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 [2023-11-29 05:17:03,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 11 treesize of output 7 [2023-11-29 05:17:03,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:17:03,595 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= |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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-29 05:17:03,597 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= |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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from true [2023-11-29 05:17:03,658 INFO L349 Elim1Store]: treesize reduction 77, result has 16.3 percent of original size [2023-11-29 05:17:03,658 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 120 treesize of output 74 [2023-11-29 05:17:03,673 INFO L349 Elim1Store]: treesize reduction 77, result has 16.3 percent of original size [2023-11-29 05:17:03,674 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 87 treesize of output 65 [2023-11-29 05:17:03,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (and (= (select |c_#valid| .cse0) 1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))))) is different from false [2023-11-29 05:17:03,695 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3))) (and (= (select |c_#valid| .cse0) 1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))))) is different from true [2023-11-29 05:17:03,710 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2023-11-29 05:17:03,710 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 88 treesize of output 39 [2023-11-29 05:17:03,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:03,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:17:03,738 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 05:17:03,741 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 05:17:03,775 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 05:17:03,777 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 05:17:03,802 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from false [2023-11-29 05:17:03,805 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2023-11-29 05:17:03,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:03,838 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 05:17:03,838 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 96 treesize of output 85 [2023-11-29 05:17:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:03,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:03,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:03,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2023-11-29 05:17:03,908 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from false [2023-11-29 05:17:03,912 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from true [2023-11-29 05:17:04,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse5) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from false [2023-11-29 05:17:04,032 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse5) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from true [2023-11-29 05:17:04,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse4) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from false [2023-11-29 05:17:04,167 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse4) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from true [2023-11-29 05:17:04,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:04,208 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 193 treesize of output 141 [2023-11-29 05:17:04,229 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-29 05:17:04,230 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 110 treesize of output 49 [2023-11-29 05:17:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:04,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 14 [2023-11-29 05:17:04,274 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 15 treesize of output 7 [2023-11-29 05:17:04,285 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from false [2023-11-29 05:17:04,287 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from true [2023-11-29 05:17:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:17:04,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:17:04,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059123902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:04,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:17:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2023-11-29 05:17:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863954282] [2023-11-29 05:17:04,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:17:04,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:17:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:17:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=692, Unknown=20, NotChecked=610, Total=1406 [2023-11-29 05:17:04,602 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 33 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:17:04,794 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) is different from false [2023-11-29 05:17:04,796 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) is different from true [2023-11-29 05:17:04,800 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= |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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-29 05:17:04,803 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= |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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from true [2023-11-29 05:17:04,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse10 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse6)) (.cse1 (select .cse2 .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse9)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse6))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (not (= (select .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3) .cse7) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse8 (select |c_#valid| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= (select |c_#valid| .cse7) 1)))))) is different from false [2023-11-29 05:17:04,813 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse10 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse6)) (.cse1 (select .cse2 .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse7) .cse9)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse6))) (and (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (not (= (select .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3) .cse7) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse8 (select |c_#valid| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= (select |c_#valid| .cse7) 1)))))) is different from true [2023-11-29 05:17:04,820 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-29 05:17:04,823 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-29 05:17:04,828 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 05:17:04,831 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 05:17:04,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))))) is different from false [2023-11-29 05:17:04,849 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((v_arrayElimIndex_5 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))))))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))))) is different from true [2023-11-29 05:17:04,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse12 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse8)) (.cse3 (select .cse2 .cse11)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse11)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse8))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (not (= (select .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse8 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) .cse9) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse10 (select |v_#valid_BEFORE_CALL_15| .cse10))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))))) is different from false [2023-11-29 05:17:04,870 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse12 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse8)) (.cse3 (select .cse2 .cse11)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse11)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse8))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (not (= (select .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse8 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) .cse9) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse10 (select |v_#valid_BEFORE_CALL_15| .cse10))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))))) is different from true [2023-11-29 05:17:04,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse7)) (.cse0 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6)) (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse7) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0))) (not (= (select .cse9 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-29 05:17:04,888 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse7)) (.cse0 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_#valid_BEFORE_CALL_14| .cse3))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6)) (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse7) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0))) (not (= (select .cse9 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from true [2023-11-29 05:17:04,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse4) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from false [2023-11-29 05:17:04,905 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse5))) (and (exists ((v_arrayElimIndex_5 Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_5) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_14| .cse1))) |v_#valid_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4)) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse4) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0)))))) is different from true [2023-11-29 05:17:04,910 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from false [2023-11-29 05:17:04,912 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_15| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_8) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|)) is different from true [2023-11-29 05:17:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:05,036 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2023-11-29 05:17:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:17:05,036 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-11-29 05:17:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:05,037 INFO L225 Difference]: With dead ends: 70 [2023-11-29 05:17:05,037 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 05:17:05,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=793, Unknown=40, NotChecked=1500, Total=2450 [2023-11-29 05:17:05,039 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 729 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:05,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 304 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 729 Unchecked, 0.2s Time] [2023-11-29 05:17:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 05:17:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-29 05:17:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 05:17:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-11-29 05:17:05,053 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 31 [2023-11-29 05:17:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:05,053 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-11-29 05:17:05,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:17:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-11-29 05:17:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:17:05,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:05,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:05,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 05:17:05,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 05:17:05,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:05,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2023-11-29 05:17:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007102014] [2023-11-29 05:17:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:17:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:07,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:17:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:17:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007102014] [2023-11-29 05:17:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007102014] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448006016] [2023-11-29 05:17:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:07,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:07,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:07,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:07,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:17:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:07,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 132 conjunts are in the unsatisfiable core [2023-11-29 05:17:07,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:07,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:17:07,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:17:07,971 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:17:07,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:17:08,040 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 23 treesize of output 11 [2023-11-29 05:17:08,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:17:08,152 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:17:08,152 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 78 treesize of output 53 [2023-11-29 05:17:08,161 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 36 treesize of output 15 [2023-11-29 05:17:08,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 05:17:08,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:17:08,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:17:08,503 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:17:08,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 05:17:08,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:08,518 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 38 treesize of output 27 [2023-11-29 05:17:08,538 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:17:08,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:17:09,190 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 49 treesize of output 15 [2023-11-29 05:17:09,194 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 155 treesize of output 100 [2023-11-29 05:17:09,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-29 05:17:09,205 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 69 treesize of output 47 [2023-11-29 05:17:09,226 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 05:17:09,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 83 [2023-11-29 05:17:09,240 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 44 treesize of output 15 [2023-11-29 05:17:09,260 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:17:09,260 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 [2023-11-29 05:17:09,387 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 78 treesize of output 50 [2023-11-29 05:17:09,536 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:17:09,536 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 47 treesize of output 26 [2023-11-29 05:17:09,540 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 7 treesize of output 3 [2023-11-29 05:17:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:17:09,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:17:09,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:09,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2023-11-29 05:17:09,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:09,869 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 204 treesize of output 207 [2023-11-29 05:17:09,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2023-11-29 05:17:10,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |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|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (and (or .cse3 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1234) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1232) .cse1) .cse2)) (+ 4 v_arrayElimCell_93))))) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1238) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1234) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1232) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_94))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_93)))))))) (.cse6 (+ (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4))) (and (or (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1234) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1232) .cse1) .cse2)) (+ 4 v_arrayElimCell_94)))) (not .cse3)) (or (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) .cse4) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1238) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1234) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1232) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 (+ 4 v_arrayElimCell_94))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 .cse6))))) (or .cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (or .cse3 (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1234) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1232) .cse1) .cse2)) .cse6))))))))) is different from false [2023-11-29 05:17:10,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |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|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse7 (= .cse4 .cse2)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse6 (and (or (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse2 v_ArrVal_1234) (select (select (store .cse3 .cse2 v_ArrVal_1232) .cse4) .cse5)) (+ 4 v_arrayElimCell_93)))) .cse7) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1238) .cse2 v_ArrVal_1234) (select (select (store .cse3 .cse2 v_ArrVal_1232) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_94))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ 4 v_arrayElimCell_93))))))))) (and (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1238) .cse2 v_ArrVal_1234) (select (select (store .cse3 .cse2 v_ArrVal_1232) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ 4 v_arrayElimCell_94))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1))))) (or (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) .cse6) (or (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse2 v_ArrVal_1234) (select (select (store .cse3 .cse2 v_ArrVal_1232) .cse4) .cse5)) .cse1))) .cse7) (or (not .cse7) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse2 v_ArrVal_1234) (select (select (store .cse3 .cse2 v_ArrVal_1232) .cse4) .cse5)) (+ 4 v_arrayElimCell_94))))) (or .cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4))))))) is different from false [2023-11-29 05:17:10,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse8)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |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|))) (let ((.cse7 (= .cse4 .cse1)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse11))) (.cse6 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (and (or (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse4 v_ArrVal_1234) (select (select (store .cse5 .cse4 v_ArrVal_1232) .cse1) .cse6)) (+ 4 v_arrayElimCell_93)))) .cse7) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1238) .cse4 v_ArrVal_1234) (select (select (store .cse5 .cse4 v_ArrVal_1232) .cse1) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_93))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_94)))))))) (.cse3 (+ .cse8 4))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1238) .cse4 v_ArrVal_1234) (select (select (store .cse5 .cse4 v_ArrVal_1232) .cse1) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ 4 v_arrayElimCell_94)))))) (or (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) .cse0) (or (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse4 v_ArrVal_1234) (select (select (store .cse5 .cse4 v_ArrVal_1232) .cse1) .cse6)) (+ 4 v_arrayElimCell_94)))) (not .cse7)) (or (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse4 v_ArrVal_1234) (select (select (store .cse5 .cse4 v_ArrVal_1232) .cse1) .cse6)) .cse3))) .cse7))))))) is different from false [2023-11-29 05:17:10,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse8)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |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|))) (let ((.cse0 (= .cse1 .cse3)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse11))) (.cse4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (and (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1238) .cse1 v_ArrVal_1234) (select (select (store .cse2 .cse1 v_ArrVal_1232) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_94))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_93)))))) (or .cse0 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse1 v_ArrVal_1234) (select (select (store .cse2 .cse1 v_ArrVal_1232) .cse3) .cse4)) (+ 4 v_arrayElimCell_93))))))) (.cse7 (+ .cse8 4))) (and (or (not .cse0) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse1 v_ArrVal_1234) (select (select (store .cse2 .cse1 v_ArrVal_1232) .cse3) .cse4)) (+ 4 v_arrayElimCell_94))))) (or .cse5 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse4) .cse5) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1238) .cse1 v_ArrVal_1234) (select (select (store .cse2 .cse1 v_ArrVal_1232) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ 4 v_arrayElimCell_94))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7))))) (or .cse0 (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int 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| v_ArrVal_1238) .cse1 v_ArrVal_1234) (select (select (store .cse2 .cse1 v_ArrVal_1232) .cse3) .cse4)) .cse7)))))))))) is different from false [2023-11-29 05:17:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448006016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:13,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:17:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-11-29 05:17:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399538327] [2023-11-29 05:17:13,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:17:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-29 05:17:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-29 05:17:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2425, Unknown=4, NotChecked=404, Total=2970 [2023-11-29 05:17:13,545 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 47 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:17:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:18,460 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2023-11-29 05:17:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 05:17:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-11-29 05:17:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:18,462 INFO L225 Difference]: With dead ends: 88 [2023-11-29 05:17:18,462 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 05:17:18,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=385, Invalid=6269, Unknown=4, NotChecked=652, Total=7310 [2023-11-29 05:17:18,464 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:18,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 333 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 05:17:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 05:17:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2023-11-29 05:17:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 05:17:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-11-29 05:17:18,484 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 32 [2023-11-29 05:17:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:18,485 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-11-29 05:17:18,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:17:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-11-29 05:17:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:17:18,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:18,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:18,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:17:18,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 05:17:18,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:18,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2023-11-29 05:17:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915687203] [2023-11-29 05:17:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:17:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:19,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:17:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:17:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:19,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915687203] [2023-11-29 05:17:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915687203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:19,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49513928] [2023-11-29 05:17:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:19,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:19,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:17:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:20,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-29 05:17:20,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:20,767 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:17:20,767 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 [2023-11-29 05:17:20,775 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 351 treesize of output 223 [2023-11-29 05:17:20,813 INFO L349 Elim1Store]: treesize reduction 90, result has 25.6 percent of original size [2023-11-29 05:17:20,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 155 [2023-11-29 05:17:20,844 INFO L349 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2023-11-29 05:17:20,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 94 [2023-11-29 05:17:22,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 163 [2023-11-29 05:17:23,011 INFO L349 Elim1Store]: treesize reduction 252, result has 48.5 percent of original size [2023-11-29 05:17:23,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 45 case distinctions, treesize of input 160 treesize of output 334 [2023-11-29 05:17:23,253 INFO L349 Elim1Store]: treesize reduction 148, result has 50.2 percent of original size [2023-11-29 05:17:23,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 196 [2023-11-29 05:17:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:17:37,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:17:38,856 INFO L349 Elim1Store]: treesize reduction 35, result has 83.6 percent of original size [2023-11-29 05:17:38,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6954 treesize of output 5568 [2023-11-29 05:17:40,139 INFO L349 Elim1Store]: treesize reduction 269, result has 67.9 percent of original size [2023-11-29 05:17:40,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 34343 treesize of output 27259 [2023-11-29 05:18:31,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 25 treesize of output 21 [2023-11-29 05:18:31,094 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 05:18:31,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 61 [2023-11-29 05:18:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49513928] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:31,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:31,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 11] total 50 [2023-11-29 05:18:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453056798] [2023-11-29 05:18:31,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:31,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 05:18:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:31,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 05:18:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 05:18:31,204 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 50 states, 43 states have (on average 1.697674418604651) internal successors, (73), 43 states have internal predecessors, (73), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 05:18:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:37,887 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2023-11-29 05:18:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-29 05:18:37,888 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 1.697674418604651) internal successors, (73), 43 states have internal predecessors, (73), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 34 [2023-11-29 05:18:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:37,889 INFO L225 Difference]: With dead ends: 113 [2023-11-29 05:18:37,889 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 05:18:37,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=572, Invalid=6568, Unknown=0, NotChecked=0, Total=7140 [2023-11-29 05:18:37,891 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 203 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:37,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 463 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 05:18:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 05:18:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2023-11-29 05:18:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 05:18:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2023-11-29 05:18:37,915 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 34 [2023-11-29 05:18:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:37,915 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2023-11-29 05:18:37,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 1.697674418604651) internal successors, (73), 43 states have internal predecessors, (73), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 05:18:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2023-11-29 05:18:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:18:37,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:37,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:37,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:18:38,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-29 05:18:38,117 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:38,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2032979073, now seen corresponding path program 3 times [2023-11-29 05:18:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072980383] [2023-11-29 05:18:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:18:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:18:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 05:18:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072980383] [2023-11-29 05:18:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072980383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174871384] [2023-11-29 05:18:38,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:18:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:38,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:38,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:38,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:18:38,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 05:18:38,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:18:38,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:18:38,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:18:38,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:18:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174871384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:38,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:18:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-29 05:18:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606661578] [2023-11-29 05:18:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:38,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:18:38,659 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:18:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:38,696 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2023-11-29 05:18:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-11-29 05:18:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:38,697 INFO L225 Difference]: With dead ends: 91 [2023-11-29 05:18:38,697 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 05:18:38,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:18:38,698 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:38,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 05:18:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 05:18:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:18:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-29 05:18:38,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 35 [2023-11-29 05:18:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:38,714 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-29 05:18:38,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:18:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-29 05:18:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:18:38,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:38,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:38,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:18:38,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 05:18:38,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:38,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash -742312008, now seen corresponding path program 2 times [2023-11-29 05:18:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278163894] [2023-11-29 05:18:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:18:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278163894] [2023-11-29 05:18:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278163894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121391457] [2023-11-29 05:18:41,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:18:41,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:41,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:41,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:18:41,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:18:41,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:18:41,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 170 conjunts are in the unsatisfiable core [2023-11-29 05:18:41,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:41,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:18:41,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:18:41,674 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:18:41,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:18:41,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:18:41,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:18:41,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:18:41,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:18:41,916 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:18:41,917 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 132 treesize of output 83 [2023-11-29 05:18:41,924 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 36 treesize of output 15 [2023-11-29 05:18:41,931 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 55 treesize of output 19 [2023-11-29 05:18:42,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-29 05:18:42,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:18:42,034 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 7 treesize of output 3 [2023-11-29 05:18:42,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:18:42,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:42,290 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 53 treesize of output 36 [2023-11-29 05:18:42,305 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:18:42,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:18:42,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 05:18:42,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:18:43,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:43,044 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 62 treesize of output 43 [2023-11-29 05:18:43,048 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 183 treesize of output 120 [2023-11-29 05:18:43,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-11-29 05:18:43,059 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 89 treesize of output 59 [2023-11-29 05:18:43,081 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 05:18:43,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 99 [2023-11-29 05:18:43,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:43,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2023-11-29 05:18:43,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2023-11-29 05:18:43,117 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:18:43,117 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 [2023-11-29 05:18:43,397 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 108 treesize of output 72 [2023-11-29 05:18:43,613 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:18:43,613 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 66 treesize of output 33 [2023-11-29 05:18:43,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:18:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:43,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:44,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |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|)) (.cse6 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (and (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1844))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1841))) (let ((.cse0 (select (select .cse3 .cse1) .cse6))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1848))) (let ((.cse4 (select (select .cse5 .cse1) .cse6))) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1846) (select (select .cse3 .cse0) .cse4)) (+ (select (select .cse5 .cse0) .cse4) 4))))))))) (not (= (store (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select v_ArrVal_1846 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_1846))))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1844))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse13 (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1848))) (let ((.cse9 (select (select .cse13 .cse1) .cse6))) (or (= .cse6 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse11 (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1841))) (let ((.cse12 (select (select .cse11 .cse1) .cse6))) (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1846) (select (select .cse11 .cse12) .cse9)) (+ (select (select .cse13 .cse12) .cse9) 4))))))))) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select v_ArrVal_1846 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_1846)))))))) is different from false [2023-11-29 05:18:44,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse17 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse17 |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|)) (.cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (and (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1844))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse2 (store .cse9 .cse1 v_ArrVal_1841))) (let ((.cse3 (select (select .cse2 .cse6) .cse7))) (or (= (let ((.cse5 (store .cse8 .cse1 v_ArrVal_1848))) (let ((.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 .cse1 v_ArrVal_1846) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 .cse6))))) (not (= (store (select .cse0 .cse1) .cse10 (select v_ArrVal_1846 .cse10)) v_ArrVal_1846))))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1844))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse15 (store .cse8 .cse1 v_ArrVal_1848))) (let ((.cse11 (select (select .cse15 .cse6) .cse7))) (or (= .cse7 .cse11) (= (let ((.cse13 (store .cse9 .cse1 v_ArrVal_1841))) (let ((.cse14 (select (select .cse13 .cse6) .cse7))) (select (select (store .cse12 .cse1 v_ArrVal_1846) (select (select .cse13 .cse14) .cse11)) (+ (select (select .cse15 .cse14) .cse11) 4)))) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= (store (select .cse12 .cse1) .cse10 (select v_ArrVal_1846 .cse10)) v_ArrVal_1846)))))))) is different from false [2023-11-29 05:18:44,327 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse19 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse17 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse16))) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse19 |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|)) (.cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse17))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse16) .cse17))) (and (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1844))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse2 (store .cse9 .cse1 v_ArrVal_1841))) (let ((.cse3 (select (select .cse2 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store .cse8 .cse1 v_ArrVal_1848))) (let ((.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 .cse1 v_ArrVal_1846) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))) (= .cse3 .cse6))))) (not (= v_ArrVal_1846 (store (select .cse0 .cse1) .cse10 (select v_ArrVal_1846 .cse10))))))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1844))) (or (not (= v_ArrVal_1846 (store (select .cse11 .cse1) .cse10 (select v_ArrVal_1846 .cse10)))) (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse15 (store .cse8 .cse1 v_ArrVal_1848))) (let ((.cse14 (select (select .cse15 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (store .cse9 .cse1 v_ArrVal_1841))) (let ((.cse13 (select (select .cse12 .cse6) .cse7))) (select (select (store .cse11 .cse1 v_ArrVal_1846) (select (select .cse12 .cse13) .cse14)) (+ (select (select .cse15 .cse13) .cse14) 4))))) (= .cse7 .cse14)))))))))))) is different from false [2023-11-29 05:18:44,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse19 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse17 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse16))) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse19 |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|)) (.cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse17))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse16) .cse17))) (and (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1844))) (or (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse2 (store .cse9 .cse1 v_ArrVal_1841))) (let ((.cse3 (select (select .cse2 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store .cse8 .cse1 v_ArrVal_1848))) (let ((.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (store .cse0 .cse1 v_ArrVal_1846) (select (select .cse2 .cse3) .cse4)) (+ 4 (select (select .cse5 .cse3) .cse4)))))) (= .cse6 .cse3))))) (not (= (store (select .cse0 .cse1) .cse10 (select v_ArrVal_1846 .cse10)) v_ArrVal_1846))))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1844))) (or (not (= (store (select .cse11 .cse1) .cse10 (select v_ArrVal_1846 .cse10)) v_ArrVal_1846)) (forall ((v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1848 (Array Int Int))) (let ((.cse15 (store .cse8 .cse1 v_ArrVal_1848))) (let ((.cse14 (select (select .cse15 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (store .cse9 .cse1 v_ArrVal_1841))) (let ((.cse13 (select (select .cse12 .cse6) .cse7))) (select (select (store .cse11 .cse1 v_ArrVal_1846) (select (select .cse12 .cse13) .cse14)) (+ 4 (select (select .cse15 .cse13) .cse14)))))) (= .cse14 .cse7)))))))))))) is different from false [2023-11-29 05:18:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121391457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:45,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:18:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2023-11-29 05:18:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32816721] [2023-11-29 05:18:45,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:45,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 05:18:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 05:18:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2505, Unknown=4, NotChecked=412, Total=3080 [2023-11-29 05:18:45,959 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 46 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:18:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:48,296 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-29 05:18:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:18:48,297 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 36 states have internal predecessors, (56), 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 35 [2023-11-29 05:18:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:48,297 INFO L225 Difference]: With dead ends: 43 [2023-11-29 05:18:48,297 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 05:18:48,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=294, Invalid=4410, Unknown=4, NotChecked=548, Total=5256 [2023-11-29 05:18:48,299 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:48,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:18:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 05:18:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 05:18:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:18:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-11-29 05:18:48,310 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2023-11-29 05:18:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:48,310 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-29 05:18:48,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:18:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-11-29 05:18:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 05:18:48,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:48,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:48,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:18:48,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 05:18:48,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:48,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -395390544, now seen corresponding path program 2 times [2023-11-29 05:18:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047896543] [2023-11-29 05:18:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:18:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047896543] [2023-11-29 05:18:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047896543] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576060273] [2023-11-29 05:18:48,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:18:48,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:48,665 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:48,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:18:48,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:18:48,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:18:48,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:18:48,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:18:48,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:18:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576060273] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:49,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-11-29 05:18:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686161181] [2023-11-29 05:18:49,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:49,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:18:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:18:49,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:18:49,020 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:18:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:49,108 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-11-29 05:18:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:18:49,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2023-11-29 05:18:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:49,109 INFO L225 Difference]: With dead ends: 46 [2023-11-29 05:18:49,109 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 05:18:49,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:18:49,110 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:49,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 05:18:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-11-29 05:18:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:18:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-11-29 05:18:49,121 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2023-11-29 05:18:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:49,122 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-11-29 05:18:49,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:18:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-11-29 05:18:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:18:49,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:49,123 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-11-29 05:18:49,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:18:49,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:49,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:49,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 627836189, now seen corresponding path program 3 times [2023-11-29 05:18:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249377567] [2023-11-29 05:18:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:50,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:18:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249377567] [2023-11-29 05:18:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249377567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85100998] [2023-11-29 05:18:51,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:18:51,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:51,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:51,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:51,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:18:51,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 05:18:51,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:18:51,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 160 conjunts are in the unsatisfiable core [2023-11-29 05:18:51,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:51,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:18:51,830 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:18:51,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:18:51,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:18:51,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:18:52,022 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:18:52,022 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 81 treesize of output 56 [2023-11-29 05:18:52,031 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 39 treesize of output 30 [2023-11-29 05:18:52,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-29 05:18:52,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 05:18:52,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:18:52,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:52,319 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 53 treesize of output 36 [2023-11-29 05:18:52,331 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:18:52,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:18:52,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-29 05:18:53,248 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 331 treesize of output 223 [2023-11-29 05:18:53,270 INFO L349 Elim1Store]: treesize reduction 66, result has 18.5 percent of original size [2023-11-29 05:18:53,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 120 [2023-11-29 05:18:53,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 52 [2023-11-29 05:18:53,302 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:18:53,303 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 [2023-11-29 05:18:53,988 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 121 treesize of output 81 [2023-11-29 05:18:54,027 INFO L349 Elim1Store]: treesize reduction 159, result has 10.2 percent of original size [2023-11-29 05:18:54,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 90 [2023-11-29 05:18:54,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 05:18:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:54,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85100998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:57,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:18:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 48 [2023-11-29 05:18:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718961631] [2023-11-29 05:18:57,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 05:18:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 05:18:57,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2964, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 05:18:57,018 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 48 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:18:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:59,222 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-11-29 05:18:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 05:18:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-11-29 05:18:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:59,223 INFO L225 Difference]: With dead ends: 41 [2023-11-29 05:18:59,223 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:18:59,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=409, Invalid=4703, Unknown=0, NotChecked=0, Total=5112 [2023-11-29 05:18:59,226 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:59,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:18:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:18:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:18:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:18:59,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2023-11-29 05:18:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:59,227 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:18:59,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:18:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:18:59,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:18:59,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:18:59,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:18:59,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:18:59,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:19:16,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 05:19:16,654 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 05:19:16,655 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:392) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeIcfgHoareAnnotation(NwaCegarLoop.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop$CegarLoopResultBuilder.getResult(AbstractCegarLoop.java:873) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 40 more [2023-11-29 05:19:16,658 INFO L158 Benchmark]: Toolchain (without parser) took 189060.26ms. Allocated memory was 119.5MB in the beginning and 408.9MB in the end (delta: 289.4MB). Free memory was 79.2MB in the beginning and 135.9MB in the end (delta: -56.6MB). Peak memory consumption was 233.5MB. Max. memory is 16.1GB. [2023-11-29 05:19:16,659 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:19:16,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.28ms. Allocated memory is still 119.5MB. Free memory was 78.9MB in the beginning and 61.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 05:19:16,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.51ms. Allocated memory is still 119.5MB. Free memory was 61.2MB in the beginning and 59.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:19:16,659 INFO L158 Benchmark]: Boogie Preprocessor took 64.40ms. Allocated memory is still 119.5MB. Free memory was 59.0MB in the beginning and 55.4MB in the end (delta: 3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:19:16,660 INFO L158 Benchmark]: RCFGBuilder took 440.04ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 55.4MB in the beginning and 127.5MB in the end (delta: -72.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-11-29 05:19:16,660 INFO L158 Benchmark]: TraceAbstraction took 188108.91ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 126.3MB in the beginning and 135.9MB in the end (delta: -9.6MB). Peak memory consumption was 236.7MB. Max. memory is 16.1GB. [2023-11-29 05:19:16,662 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.28ms. Allocated memory is still 119.5MB. Free memory was 78.9MB in the beginning and 61.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.51ms. Allocated memory is still 119.5MB. Free memory was 61.2MB in the beginning and 59.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.40ms. Allocated memory is still 119.5MB. Free memory was 59.0MB in the beginning and 55.4MB in the end (delta: 3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 440.04ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 55.4MB in the beginning and 127.5MB in the end (delta: -72.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 188108.91ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 126.3MB in the beginning and 135.9MB in the end (delta: -9.6MB). Peak memory consumption was 236.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:19:18,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:19:18,552 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:19:18,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:19:18,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:19:18,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:19:18,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:19:18,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:19:18,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:19:18,588 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:19:18,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:19:18,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:19:18,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:19:18,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:19:18,591 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:19:18,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:19:18,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:19:18,593 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:19:18,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:19:18,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:19:18,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:19:18,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:19:18,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:19:18,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:19:18,595 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:19:18,596 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:19:18,596 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:19:18,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:19:18,597 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:19:18,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:19:18,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:19:18,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:19:18,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:19:18,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:19:18,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:19:18,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:19:18,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:19:18,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:19:18,600 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:19:18,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:19:18,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:19:18,600 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:19:18,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:19:18,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:19:18,601 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:19:18,601 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_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-29 05:19:18,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:19:18,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:19:18,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:19:18,917 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:19:18,918 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:19:18,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 05:19:21,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:19:21,959 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:19:21,959 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-29 05:19:21,975 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data/5bc1a4886/a66fd35e756b41a489cbee9c078c34e0/FLAG6b6fd8612 [2023-11-29 05:19:21,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/data/5bc1a4886/a66fd35e756b41a489cbee9c078c34e0 [2023-11-29 05:19:21,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:19:21,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:19:21,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:19:21,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:19:22,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:19:22,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:19:21" (1/1) ... [2023-11-29 05:19:22,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381645a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22, skipping insertion in model container [2023-11-29 05:19:22,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:19:21" (1/1) ... [2023-11-29 05:19:22,049 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:19:22,320 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-29 05:19:22,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:19:22,338 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:19:22,383 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-11-29 05:19:22,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:19:22,414 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:19:22,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22 WrapperNode [2023-11-29 05:19:22,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:19:22,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:19:22,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:19:22,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:19:22,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,474 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-11-29 05:19:22,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:19:22,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:19:22,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:19:22,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:19:22,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,508 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2023-11-29 05:19:22,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:19:22,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:19:22,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:19:22,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:19:22,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (1/1) ... [2023-11-29 05:19:22,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:19:22,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:22,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:19:22,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:19:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:19:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:19:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 05:19:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:19:22,596 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:19:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:19:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:19:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:19:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:19:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:19:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:19:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:19:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:19:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:19:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:19:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:19:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:19:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:19:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:19:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:19:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:19:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:19:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:19:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:19:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:19:22,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:19:22,751 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:19:22,754 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:19:23,153 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:19:23,202 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:19:23,202 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:19:23,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:19:23 BoogieIcfgContainer [2023-11-29 05:19:23,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:19:23,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:19:23,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:19:23,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:19:23,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:19:21" (1/3) ... [2023-11-29 05:19:23,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133a9704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:19:23, skipping insertion in model container [2023-11-29 05:19:23,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:19:22" (2/3) ... [2023-11-29 05:19:23,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133a9704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:19:23, skipping insertion in model container [2023-11-29 05:19:23,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:19:23" (3/3) ... [2023-11-29 05:19:23,213 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-29 05:19:23,234 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:19:23,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:19:23,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:19:23,294 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51770ca3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:19:23,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:19:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:19:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:19:23,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:23,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:23,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:23,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2023-11-29 05:19:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341885281] [2023-11-29 05:19:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:23,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:23,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:23,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:19:23,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:19:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:23,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:19:23,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:23,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:19:23,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:19:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341885281] [2023-11-29 05:19:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341885281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:23,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:19:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:19:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251388901] [2023-11-29 05:19:23,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:23,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:19:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:19:23,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:19:23,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:19:23,596 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:19:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:23,646 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-11-29 05:19:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:19:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-29 05:19:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:23,653 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:19:23,653 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 05:19:23,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:19:23,659 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:23,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:19:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 05:19:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 05:19:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:19:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-29 05:19:23,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-11-29 05:19:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:23,688 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-29 05:19:23,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:19:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-29 05:19:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:19:23,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:23,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:23,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:19:23,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:23,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:23,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2023-11-29 05:19:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89227120] [2023-11-29 05:19:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:23,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:23,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:19:23,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:19:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:24,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:19:24,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:24,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:19:24,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:19:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89227120] [2023-11-29 05:19:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89227120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:24,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:19:24,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:19:24,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501644628] [2023-11-29 05:19:24,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:24,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:19:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:19:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:19:24,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:19:24,121 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:19:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:24,187 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-11-29 05:19:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:19:24,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-29 05:19:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:24,189 INFO L225 Difference]: With dead ends: 43 [2023-11-29 05:19:24,189 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 05:19:24,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:19:24,191 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:24,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:19:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 05:19:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-29 05:19:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:19:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 05:19:24,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2023-11-29 05:19:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:24,200 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 05:19:24,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:19:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 05:19:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:19:24,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:24,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:24,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:19:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:24,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:24,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2023-11-29 05:19:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495198157] [2023-11-29 05:19:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:24,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:19:24,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:19:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:24,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:19:24,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:24,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 05:19:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:24,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:19:24,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:19:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495198157] [2023-11-29 05:19:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495198157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:24,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:19:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-11-29 05:19:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094714752] [2023-11-29 05:19:24,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:24,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:19:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:19:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:19:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:19:24,857 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:19:28,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:19:33,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:19:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:33,755 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-11-29 05:19:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:19:33,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-11-29 05:19:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:33,757 INFO L225 Difference]: With dead ends: 36 [2023-11-29 05:19:33,757 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:19:33,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:19:33,759 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:33,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 158 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 05:19:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:19:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-29 05:19:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:19:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-29 05:19:33,766 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-11-29 05:19:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:33,767 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-29 05:19:33,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:19:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-29 05:19:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:19:33,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:33,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:33,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:19:33,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:33,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:33,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2023-11-29 05:19:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756311729] [2023-11-29 05:19:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:33,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:19:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:33,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:19:33,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:19:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:34,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:19:34,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:34,192 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 7 [2023-11-29 05:19:34,369 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:19:34,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:19:34,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:34,563 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:19:34,564 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 72 treesize of output 59 [2023-11-29 05:19:34,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-29 05:19:34,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:19:34,735 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 05:19:34,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:34,755 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 48 treesize of output 37 [2023-11-29 05:19:34,793 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-29 05:19:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2023-11-29 05:19:34,859 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 28 treesize of output 20 [2023-11-29 05:19:34,920 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 35 treesize of output 19 [2023-11-29 05:19:34,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 05:19:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 05:19:34,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:36,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:19:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756311729] [2023-11-29 05:19:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756311729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1223640946] [2023-11-29 05:19:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:36,862 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:19:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:19:36,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:19:36,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-29 05:19:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:37,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 05:19:37,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:37,228 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 7 [2023-11-29 05:19:37,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 05:19:37,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:37,727 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 05:19:37,727 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 17 treesize of output 17 [2023-11-29 05:19:38,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:38,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 26 [2023-11-29 05:19:38,307 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 [2023-11-29 05:19:38,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-29 05:19:38,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:19:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:38,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:38,798 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 76 treesize of output 72 [2023-11-29 05:19:39,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.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|))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_22 (_ BitVec 32))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_302)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_302) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_301) .cse3) (bvadd (_ bv4 32) v_arrayElimCell_22)))))) (.cse5 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_302)) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_302) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_301) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (forall ((v_arrayElimCell_22 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (bvadd (_ bv4 32) v_arrayElimCell_22))))))))) (or (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_302)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_302) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_301) .cse3) .cse2)))) (not .cse4) (not .cse5)) (or .cse6 .cse4) (or .cse6 .cse5)))) is different from false [2023-11-29 05:19:39,498 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select (store |c_#memory_$Pointer$#1.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_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse0 (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_22 (_ BitVec 32))) (or (not (= (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_302)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_302) .cse5 v_ArrVal_301) .cse6) (bvadd (_ bv4 32) v_arrayElimCell_22)))))) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (and (or .cse0 .cse1) (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_302)) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_302) .cse5 v_ArrVal_301) .cse6))) (or (forall ((v_arrayElimCell_22 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 (bvadd (_ bv4 32) v_arrayElimCell_22)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4))))))) (or (not .cse1) (not .cse7) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_302)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_302) .cse5 v_ArrVal_301) .cse6) .cse4))))) (or .cse0 .cse7))))) is different from false [2023-11-29 05:19:39,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse3 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select (store |c_#memory_$Pointer$#1.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|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) (.cse6 (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_22 (_ BitVec 32))) (or (not (= v_ArrVal_302 (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_302) .cse3 v_ArrVal_301) .cse4) (bvadd (_ bv4 32) v_arrayElimCell_22)))))) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_302 (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_302) .cse3 v_ArrVal_301) .cse4) .cse5))))) (or .cse6 .cse1) (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_302 (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_302 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_302) .cse3 v_ArrVal_301) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse5)) (forall ((v_arrayElimCell_22 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (bvadd (_ bv4 32) v_arrayElimCell_22))))))))) (or .cse6 .cse0))))) is different from false [2023-11-29 05:19:39,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:39,899 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 1590 treesize of output 1477 [2023-11-29 05:19:39,930 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 744 treesize of output 736 [2023-11-29 05:19:39,948 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 736 treesize of output 732 [2023-11-29 05:19:39,967 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 732 treesize of output 724 [2023-11-29 05:19:40,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,033 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 724 treesize of output 721 [2023-11-29 05:19:41,378 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 114 treesize of output 106 [2023-11-29 05:19:41,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:19:41,417 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 114 treesize of output 106 [2023-11-29 05:19:41,460 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 121 treesize of output 109 [2023-11-29 05:19:41,502 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:19:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1223640946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:53,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:19:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2023-11-29 05:19:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263734903] [2023-11-29 05:19:53,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:53,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 05:19:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:19:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 05:19:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1097, Unknown=15, NotChecked=276, Total=1482 [2023-11-29 05:19:53,455 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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) [2023-11-29 05:20:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:20:03,320 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2023-11-29 05:20:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:20:03,321 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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 27 [2023-11-29 05:20:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:20:03,322 INFO L225 Difference]: With dead ends: 61 [2023-11-29 05:20:03,322 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 05:20:03,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=251, Invalid=2612, Unknown=15, NotChecked=428, Total=3306 [2023-11-29 05:20:03,325 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 66 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:20:03,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 366 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 629 Invalid, 0 Unknown, 61 Unchecked, 7.8s Time] [2023-11-29 05:20:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 05:20:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2023-11-29 05:20:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2023-11-29 05:20:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-11-29 05:20:03,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 27 [2023-11-29 05:20:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:20:03,338 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-29 05:20:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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) [2023-11-29 05:20:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2023-11-29 05:20:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:20:03,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:20:03,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:20:03,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:20:03,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-11-29 05:20:03,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:20:03,741 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:20:03,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:20:03,741 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2023-11-29 05:20:03,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:20:03,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622680396] [2023-11-29 05:20:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:20:03,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:20:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:20:03,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:20:03,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:20:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:20:03,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 05:20:03,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:20:03,996 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 7 [2023-11-29 05:20:04,247 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:20:04,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:20:04,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:20:04,511 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:20:04,511 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 72 treesize of output 59 [2023-11-29 05:20:04,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-29 05:20:04,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:20:04,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:20:04,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:04,940 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 48 treesize of output 37 [2023-11-29 05:20:04,990 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-29 05:20:04,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2023-11-29 05:20:05,759 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:20:05,776 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-11-29 05:20:05,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 19 [2023-11-29 05:20:06,080 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 59 treesize of output 26 [2023-11-29 05:20:06,085 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 [2023-11-29 05:20:06,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-29 05:20:06,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:20:06,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:20:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:20:06,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:20:07,038 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_381 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_381 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_381) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.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|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.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_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-29 05:20:07,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_381) (select (select |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |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|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_381 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_381 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-29 05:20:07,203 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_381) (select (select |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_383) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |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|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_381 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) v_ArrVal_381)))) is different from false [2023-11-29 05:20:07,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:07,501 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 266 treesize of output 270 [2023-11-29 05:20:07,513 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 238 treesize of output 206 [2023-11-29 05:20:07,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-11-29 05:20:07,680 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 306 treesize of output 274 [2023-11-29 05:20:21,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:20:21,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622680396] [2023-11-29 05:20:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622680396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:20:21,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [151806774] [2023-11-29 05:20:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:20:21,052 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:20:21,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:20:21,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:20:21,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-11-29 05:20:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:20:21,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-29 05:20:21,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:20:21,478 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 7 [2023-11-29 05:20:22,281 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:20:22,281 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 19 treesize of output 27 [2023-11-29 05:20:22,501 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 [2023-11-29 05:20:22,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:20:23,060 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 19 treesize of output 11 [2023-11-29 05:20:23,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:20:23,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:20:23,464 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 [2023-11-29 05:20:23,771 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 05:20:23,772 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 24 treesize of output 26 [2023-11-29 05:20:23,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:20:25,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:20:25,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:20:25,187 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 [2023-11-29 05:20:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:25,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:20:25,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:25,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30 [2023-11-29 05:20:26,499 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:20:26,499 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 [2023-11-29 05:20:26,567 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-29 05:20:26,568 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 36 [2023-11-29 05:20:26,613 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 59 treesize of output 26 [2023-11-29 05:20:26,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-29 05:20:26,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:20:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:20:26,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:20:26,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_468) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_467) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.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|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.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_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_468 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) v_ArrVal_468)))) is different from false [2023-11-29 05:20:31,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:31,365 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 3998 treesize of output 3670 [2023-11-29 05:20:31,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:31,590 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 1543 treesize of output 1463 [2023-11-29 05:20:31,704 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 795 treesize of output 667 [2023-11-29 05:20:35,325 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 21 treesize of output 17 [2023-11-29 05:20:39,115 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 10 treesize of output 4 [2023-11-29 05:20:39,206 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 10 treesize of output 4 [2023-11-29 05:20:39,281 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 10 treesize of output 4 [2023-11-29 05:20:39,905 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 306 treesize of output 274 [2023-11-29 05:20:40,021 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 306 treesize of output 274 [2023-11-29 05:20:40,110 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 359 treesize of output 311 [2023-11-29 05:20:40,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:40,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:40,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:40,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:40,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:40,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:45,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse16 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (not (= .cse3 (_ bv0 32))))) (let ((.cse9 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1)))))) (.cse7 (and (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_475) .cse3) .cse5))) (or (= .cse17 (_ bv0 32)) (= (_ bv4 32) .cse17)))) .cse14)) (.cse8 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|)) (.cse10 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse0 (not (= (_ bv0 1) (select |c_#valid| .cse3)))) (.cse11 (or (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) (_ bv0 32)) .cse5) (_ bv0 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))))) .cse14)) (.cse12 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) .cse3) .cse5))) (or (= .cse15 (_ bv0 32)) (= (_ bv4 32) .cse15))))))) (.cse6 (= .cse5 (_ bv0 32))) (.cse1 (= (_ bv4 32) .cse5))) (and (or .cse0 (not .cse1)) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) .cse3) .cse5))) (or (= .cse4 (_ bv0 32)) (= (_ bv4 32) .cse4)))))) (or (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) .cse3) .cse5) (_ bv0 32)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3)))) .cse6) (or .cse7 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))))) (or .cse8 .cse9) (or .cse9 .cse10) (or .cse1 (and (or .cse6 (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) .cse3) .cse5) (_ bv0 32))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3)))) .cse11 .cse12)) (or .cse7 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))))))) (or (let ((.cse13 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1)))))) (and (or .cse8 .cse13) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))))) (or .cse13 .cse10) (or .cse0 (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| .cse3)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not .cse6)) (or (and .cse11 (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) .cse3) .cse5) (_ bv0 32))))) .cse12) .cse6))) .cse1) (or (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) (_ bv0 32)) .cse5) (_ bv0 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ bv0 32)))) .cse14) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| .cse3) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27|) (_ bv0 1))) (forall ((v_ArrVal_475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_27| v_ArrVal_475) .cse3) .cse5) (_ bv0 32)))))))))) is different from false [2023-11-29 05:20:45,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [151806774] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:20:45,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:20:45,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 43 [2023-11-29 05:20:45,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78250379] [2023-11-29 05:20:45,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:20:45,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 05:20:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:20:45,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 05:20:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=20, NotChecked=530, Total=3306 [2023-11-29 05:20:45,289 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:21:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:21:01,714 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2023-11-29 05:21:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 05:21:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-11-29 05:21:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:21:01,717 INFO L225 Difference]: With dead ends: 64 [2023-11-29 05:21:01,717 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 05:21:01,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=455, Invalid=5245, Unknown=20, NotChecked=760, Total=6480 [2023-11-29 05:21:01,720 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:21:01,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 277 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-11-29 05:21:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 05:21:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2023-11-29 05:21:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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) [2023-11-29 05:21:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2023-11-29 05:21:01,736 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 29 [2023-11-29 05:21:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:21:01,736 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2023-11-29 05:21:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:21:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2023-11-29 05:21:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:21:01,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:21:01,738 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:21:01,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:21:01,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-11-29 05:21:02,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:21:02,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:21:02,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:02,140 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2023-11-29 05:21:02,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:21:02,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043456658] [2023-11-29 05:21:02,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:02,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:21:02,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:21:02,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:21:02,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:21:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:02,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 05:21:02,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:21:02,387 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 7 [2023-11-29 05:21:02,614 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:21:02,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:21:02,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:21:02,835 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:21:02,835 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 72 treesize of output 59 [2023-11-29 05:21:02,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-29 05:21:02,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:21:03,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:03,178 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 48 treesize of output 37 [2023-11-29 05:21:03,237 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-29 05:21:03,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2023-11-29 05:21:04,126 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 97 treesize of output 59 [2023-11-29 05:21:04,134 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 119 treesize of output 76 [2023-11-29 05:21:04,200 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-11-29 05:21:04,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 90 [2023-11-29 05:21:04,208 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 80 treesize of output 57 [2023-11-29 05:21:04,349 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 84 treesize of output 64 [2023-11-29 05:21:04,547 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 79 treesize of output 47 [2023-11-29 05:21:04,555 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 05:21:04,555 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 44 treesize of output 19 [2023-11-29 05:21:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:04,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:21:07,215 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31| (_ BitVec 32)) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (_ BitVec 32))) (or (not (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (select (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31| (store v_ArrVal_555 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31| v_ArrVal_555) .cse0) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_551)) .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_31|) (_ bv0 1))))) is different from false [2023-11-29 05:21:07,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:21:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043456658] [2023-11-29 05:21:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043456658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:21:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1381384313] [2023-11-29 05:21:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:21:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:21:07,224 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:21:07,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0eb5c65-aa88-413a-b52a-097f6a9262b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-11-29 05:21:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:07,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 05:21:07,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:21:07,709 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 7 [2023-11-29 05:21:08,775 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:21:08,775 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 19 treesize of output 27 [2023-11-29 05:21:09,023 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 [2023-11-29 05:21:09,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:21:09,603 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 19 treesize of output 11 [2023-11-29 05:21:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:21:10,082 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 [2023-11-29 05:21:10,411 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 05:21:10,411 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 24 treesize of output 26 [2023-11-29 05:21:10,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:21:11,751 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:11,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:11,753 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 [2023-11-29 05:21:13,146 INFO L349 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2023-11-29 05:21:13,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 63 [2023-11-29 05:21:13,237 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-29 05:21:13,237 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 118 treesize of output 86 [2023-11-29 05:21:13,363 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-11-29 05:21:13,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 89 [2023-11-29 05:21:13,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-11-29 05:21:13,400 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 24 treesize of output 20 [2023-11-29 05:21:13,451 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 05:21:13,451 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 [2023-11-29 05:21:13,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:21:14,113 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 47 treesize of output 27 [2023-11-29 05:21:14,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:21:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:14,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:21:22,741 INFO L349 Elim1Store]: treesize reduction 437, result has 48.6 percent of original size [2023-11-29 05:21:22,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 2934 treesize of output 2935 [2023-11-29 05:21:26,202 INFO L349 Elim1Store]: treesize reduction 204, result has 71.7 percent of original size [2023-11-29 05:21:26,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1731 treesize of output 2022 [2023-11-29 05:21:26,345 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 296 treesize of output 254 [2023-11-29 05:23:25,359 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 10 treesize of output 4 [2023-11-29 05:24:18,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:24:18,940 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 37 treesize of output 35 [2023-11-29 05:24:48,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:24:48,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-11-29 05:25:05,130 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 10 treesize of output 4 [2023-11-29 05:25:17,803 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-29 05:25:17,803 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 46 treesize of output 33 [2023-11-29 05:25:35,559 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 10 treesize of output 4 [2023-11-29 05:26:42,106 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:26:52,543 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 10 treesize of output 4 [2023-11-29 05:29:56,673 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 3835 DAG size of output: 5115 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)