./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.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_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI --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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:47:42,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:47:42,093 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:47:42,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:47:42,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:47:42,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:47:42,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:47:42,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:47:42,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:47:42,130 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:47:42,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:47:42,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:47:42,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:47:42,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:47:42,134 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:47:42,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:47:42,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:47:42,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:47:42,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:47:42,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:47:42,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:47:42,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:47:42,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:47:42,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:47:42,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:47:42,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:47:42,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:47:42,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:47:42,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:47:42,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:47:42,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:47:42,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:47:42,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:47:42,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:47:42,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:47:42,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:47:42,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:47:42,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:47:42,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:47:42,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:47:42,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:47:42,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:47:42,151 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_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/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_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-11-24 21:47:42,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:47:42,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:47:42,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:47:42,570 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:47:42,572 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:47:42,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-24 21:47:45,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:47:45,993 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:47:45,994 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-24 21:47:46,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/data/a100068f6/77b604103fa24225aa90aa274baa68f8/FLAGf86b3df7f [2023-11-24 21:47:46,029 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/data/a100068f6/77b604103fa24225aa90aa274baa68f8 [2023-11-24 21:47:46,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:47:46,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:47:46,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:47:46,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:47:46,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:47:46,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6ed844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46, skipping insertion in model container [2023-11-24 21:47:46,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,089 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:47:46,507 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_fb95b06e-e369-4437-9516-b96220ec8691/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-24 21:47:46,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:47:46,523 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:47:46,575 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_fb95b06e-e369-4437-9516-b96220ec8691/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-24 21:47:46,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:47:46,612 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:47:46,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46 WrapperNode [2023-11-24 21:47:46,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:47:46,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:47:46,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:47:46,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:47:46,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,670 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-24 21:47:46,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:47:46,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:47:46,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:47:46,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:47:46,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,723 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 15, 10]. 56 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-24 21:47:46,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:47:46,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:47:46,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:47:46,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:47:46,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (1/1) ... [2023-11-24 21:47:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:47:46,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:47:46,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:47:46,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:47:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:47:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:47:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:47:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:47:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:47:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:47:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-24 21:47:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-24 21:47:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:47:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:47:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:47:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:47:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:47:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-24 21:47:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:47:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:47:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-24 21:47:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:47:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-24 21:47:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-24 21:47:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-24 21:47:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:47:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:47:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:47:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:47:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:47:47,023 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:47:47,026 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:47:47,348 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:47:47,415 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:47:47,415 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 21:47:47,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:47:47 BoogieIcfgContainer [2023-11-24 21:47:47,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:47:47,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:47:47,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:47:47,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:47:47,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:47:46" (1/3) ... [2023-11-24 21:47:47,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1c2d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:47:47, skipping insertion in model container [2023-11-24 21:47:47,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:46" (2/3) ... [2023-11-24 21:47:47,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1c2d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:47:47, skipping insertion in model container [2023-11-24 21:47:47,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:47:47" (3/3) ... [2023-11-24 21:47:47,427 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-11-24 21:47:47,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:47:47,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 21:47:47,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:47:47,505 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;@72b15f61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:47:47,505 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 21:47:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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-24 21:47:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 21:47:47,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:47:47,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:47,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:47:47,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1425185690, now seen corresponding path program 1 times [2023-11-24 21:47:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:47,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861194976] [2023-11-24 21:47:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:47:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-24 21:47:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:47,940 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-24 21:47:47,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861194976] [2023-11-24 21:47:47,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861194976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:47,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:47,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:47:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305364912] [2023-11-24 21:47:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:47,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:47:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:47:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:47:47,986 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-24 21:47:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:47:48,086 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2023-11-24 21:47:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:47:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2023-11-24 21:47:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:47:48,097 INFO L225 Difference]: With dead ends: 56 [2023-11-24 21:47:48,098 INFO L226 Difference]: Without dead ends: 24 [2023-11-24 21:47:48,101 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-24 21:47:48,108 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:47:48,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:47:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-24 21:47:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-24 21:47:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-24 21:47:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-24 21:47:48,152 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2023-11-24 21:47:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:47:48,154 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-24 21:47:48,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-24 21:47:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-24 21:47:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 21:47:48,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:47:48,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:47:48,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:47:48,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 766587872, now seen corresponding path program 1 times [2023-11-24 21:47:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:48,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872581014] [2023-11-24 21:47:48,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:47:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-24 21:47:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:48,505 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-24 21:47:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872581014] [2023-11-24 21:47:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872581014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:48,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:47:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210683344] [2023-11-24 21:47:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:48,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:47:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:48,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:47:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:47:48,518 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-24 21:47:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:47:48,597 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-11-24 21:47:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:47:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 17 [2023-11-24 21:47:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:47:48,600 INFO L225 Difference]: With dead ends: 45 [2023-11-24 21:47:48,600 INFO L226 Difference]: Without dead ends: 27 [2023-11-24 21:47:48,601 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-24 21:47:48,603 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:47:48,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:47:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-24 21:47:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-24 21:47:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-24 21:47:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-24 21:47:48,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2023-11-24 21:47:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:47:48,622 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-24 21:47:48,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-24 21:47:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-24 21:47:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 21:47:48,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:47:48,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:48,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:47:48,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:47:48,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash 650879369, now seen corresponding path program 1 times [2023-11-24 21:47:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299744094] [2023-11-24 21:47:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:47:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 21:47:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 21:47:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:49,257 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-24 21:47:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299744094] [2023-11-24 21:47:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299744094] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:47:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805114798] [2023-11-24 21:47:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:47:49,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:47:49,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:47:49,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:47:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:49,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-24 21:47:49,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:47:49,816 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-24 21:47:49,837 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-24 21:47:49,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:47:49,902 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-24 21:47:49,948 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-24 21:47:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805114798] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:47:49,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:47:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-11-24 21:47:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159115471] [2023-11-24 21:47:49,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:47:49,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 21:47:49,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 21:47:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-24 21:47:49,956 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 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-24 21:47:53,968 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-24 21:47:57,986 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-24 21:48:02,006 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-24 21:48:06,044 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-24 21:48:10,227 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-24 21:48:14,294 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-24 21:48:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:48:14,297 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-24 21:48:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 21:48:14,300 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 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 23 [2023-11-24 21:48:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:48:14,301 INFO L225 Difference]: With dead ends: 38 [2023-11-24 21:48:14,301 INFO L226 Difference]: Without dead ends: 30 [2023-11-24 21:48:14,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2023-11-24 21:48:14,303 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:48:14,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2023-11-24 21:48:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-24 21:48:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-24 21:48:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-24 21:48:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-11-24 21:48:14,311 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 23 [2023-11-24 21:48:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:48:14,311 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-11-24 21:48:14,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 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-24 21:48:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-11-24 21:48:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:48:14,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:48:14,315 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] [2023-11-24 21:48:14,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-24 21:48:14,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:48:14,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:48:14,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash 18333322, now seen corresponding path program 1 times [2023-11-24 21:48:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715542291] [2023-11-24 21:48:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:48:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 21:48:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 21:48:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:16,110 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-24 21:48:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715542291] [2023-11-24 21:48:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715542291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:48:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095991554] [2023-11-24 21:48:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:16,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:48:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:48:16,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:48:16,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:48:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:16,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-24 21:48:16,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:48:16,353 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-24 21:48:16,577 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 21:48:16,578 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-24 21:48:16,654 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-24 21:48:16,768 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-24 21:48:16,769 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-24 21:48:16,856 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-24 21:48:16,864 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-24 21:48:16,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:48:16,979 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-24 21:48:17,001 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-24 21:48:17,003 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-24 21:48:17,118 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-24 21:48:17,177 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-24 21:48:17,182 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-24 21:48:17,221 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-24 21:48:17,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:48:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095991554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:48:17,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:48:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 32 [2023-11-24 21:48:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826687294] [2023-11-24 21:48:17,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:48:17,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-24 21:48:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-24 21:48:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2023-11-24 21:48:17,448 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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-24 21:48:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:48:18,297 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-11-24 21:48:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 21:48:18,298 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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 26 [2023-11-24 21:48:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:48:18,299 INFO L225 Difference]: With dead ends: 51 [2023-11-24 21:48:18,299 INFO L226 Difference]: Without dead ends: 42 [2023-11-24 21:48:18,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2023-11-24 21:48:18,302 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:48:18,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 281 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 21:48:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-24 21:48:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-11-24 21:48:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-24 21:48:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-11-24 21:48:18,313 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 26 [2023-11-24 21:48:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:48:18,313 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-11-24 21:48:18,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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-24 21:48:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-11-24 21:48:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 21:48:18,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:48:18,315 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] [2023-11-24 21:48:18,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 21:48:18,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:48:18,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:48:18,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1948213679, now seen corresponding path program 1 times [2023-11-24 21:48:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:18,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377098011] [2023-11-24 21:48:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:48:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 21:48:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:20,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 21:48:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:20,642 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-24 21:48:20,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377098011] [2023-11-24 21:48:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377098011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:48:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784433454] [2023-11-24 21:48:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:20,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:48:20,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:48:20,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:48:20,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:48:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:20,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-24 21:48:20,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:48:20,899 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-24 21:48:21,100 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) (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-24 21:48:21,103 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) (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-24 21:48:21,130 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-24 21:48:21,137 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))) (= (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-24 21:48:21,140 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))) (= (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-24 21:48:21,216 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-24 21:48:21,217 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-24 21:48:21,235 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_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~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_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-24 21:48:21,238 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_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~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_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-24 21:48:21,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2023-11-24 21:48:21,293 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-24 21:48:21,296 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-24 21:48:21,332 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-24 21:48:21,335 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-24 21:48:21,372 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-24 21:48:21,379 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-24 21:48:21,382 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-24 21:48:21,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:48:21,445 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-24 21:48:21,483 WARN L854 $PredicateComparison]: unable to prove that (and (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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (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-24 21:48:21,488 WARN L876 $PredicateComparison]: unable to prove that (and (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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (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-24 21:48:21,579 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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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)))))) is different from false [2023-11-24 21:48:21,583 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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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)))))) is different from true [2023-11-24 21:48:21,676 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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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))) is different from false [2023-11-24 21:48:21,681 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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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))) is different from true [2023-11-24 21:48:21,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:48:21,826 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2023-11-24 21:48:21,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 33 treesize of output 12 [2023-11-24 21:48:21,895 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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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)))))) is different from false [2023-11-24 21:48:21,899 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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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)))))) is different from true [2023-11-24 21:48:22,078 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-24 21:48:22,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:48:22,094 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-24 21:48:22,135 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-24 21:48:22,135 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-24 21:48:22,759 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-24 21:48:24,729 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 (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_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 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 ((.cse1 (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| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 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 ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (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 ((.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_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 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| .cse0) 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| .cse0) 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)))))) is different from false [2023-11-24 21:48:24,737 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 (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_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 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 ((.cse1 (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| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 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 ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (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 ((.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_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 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| .cse0) 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| .cse0) 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)))))) is different from true [2023-11-24 21:48:24,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:48:24,967 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 244 treesize of output 224 [2023-11-24 21:48:24,999 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-24 21:48:25,016 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-24 21:48:25,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:48:25,209 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (v_ArrVal_660 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (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_660)) (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|) v_ArrVal_657) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (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.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-24 21:48:25,229 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (v_ArrVal_660 Int)) (= |c_ULTIMATE.start_main_~uneq~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_660)) (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_657) (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-24 21:48:25,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:48:25,503 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-24 21:48:25,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:48:25,520 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-24 21:48:25,529 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-24 21:48:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784433454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:48:25,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:48:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 35 [2023-11-24 21:48:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155760693] [2023-11-24 21:48:25,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:48:25,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-24 21:48:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:25,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-24 21:48:25,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=680, Unknown=38, NotChecked=832, Total=1640 [2023-11-24 21:48:25,758 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 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-24 21:48:26,002 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) (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-24 21:48:26,005 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) (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-24 21:48:26,009 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))) (= (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-24 21:48:26,012 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))) (= (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-24 21:48:26,020 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_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_~uneq~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_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-24 21:48:26,024 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_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_~uneq~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_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-24 21:48:26,031 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-24 21:48:26,034 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-24 21:48:26,040 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-24 21:48:26,043 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-24 21:48:26,060 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-24 21:48:26,065 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-24 21:48:26,082 WARN L854 $PredicateComparison]: unable to prove that (and (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) (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_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (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-24 21:48:26,086 WARN L876 $PredicateComparison]: unable to prove that (and (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) (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_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4)) (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-24 21:48:26,109 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.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|) (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|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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)))))) is different from false [2023-11-24 21:48:26,114 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.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|) (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|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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)))))) is different from true [2023-11-24 21:48:26,144 WARN L854 $PredicateComparison]: unable to prove that (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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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))) is different from false [2023-11-24 21:48:26,149 WARN L876 $PredicateComparison]: unable to prove that (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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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))) is different from true [2023-11-24 21:48:26,166 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.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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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) (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)))))) is different from false [2023-11-24 21:48:26,170 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.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_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (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) (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)))))) is different from true [2023-11-24 21:48:27,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (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|)) (.cse1 (select .cse2 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_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 4)) (= (select (select |c_#memory_int#1| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) |c_ULTIMATE.start_main_~uneq~0#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 ((.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) (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 ((.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))))))) (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 ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 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| .cse1) 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| .cse1) 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))))))) is different from false [2023-11-24 21:48:27,993 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (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|)) (.cse1 (select .cse2 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_~uneq~0#1| (select (select |c_#memory_int#1| .cse1) 4)) (= (select (select |c_#memory_int#1| (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) |c_ULTIMATE.start_main_~uneq~0#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 ((.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) (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 ((.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))))))) (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 ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_24) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 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| .cse1) 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| .cse1) 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))))))) is different from true [2023-11-24 21:48:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:48:28,238 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-11-24 21:48:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 21:48:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2023-11-24 21:48:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:48:28,240 INFO L225 Difference]: With dead ends: 47 [2023-11-24 21:48:28,241 INFO L226 Difference]: Without dead ends: 45 [2023-11-24 21:48:28,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=124, Invalid=782, Unknown=60, NotChecked=1896, Total=2862 [2023-11-24 21:48:28,244 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 918 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:48:28,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 918 Unchecked, 0.4s Time] [2023-11-24 21:48:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-24 21:48:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-24 21:48:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-24 21:48:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2023-11-24 21:48:28,257 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 28 [2023-11-24 21:48:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:48:28,257 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2023-11-24 21:48:28,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 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-24 21:48:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2023-11-24 21:48:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 21:48:28,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:48:28,260 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] [2023-11-24 21:48:28,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:48:28,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:48:28,468 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:48:28,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -372374486, now seen corresponding path program 1 times [2023-11-24 21:48:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:28,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922713320] [2023-11-24 21:48:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:48:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 21:48:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 21:48:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:32,425 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-24 21:48:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922713320] [2023-11-24 21:48:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922713320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:48:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741873864] [2023-11-24 21:48:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:48:32,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:48:32,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:48:32,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb95b06e-e369-4437-9516-b96220ec8691/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:48:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:32,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 146 conjunts are in the unsatisfiable core [2023-11-24 21:48:32,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:48:32,743 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-24 21:48:33,097 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-24 21:48:33,224 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 21:48:33,225 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-24 21:48:33,373 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-24 21:48:33,393 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-24 21:48:33,407 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-24 21:48:33,610 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-24 21:48:33,610 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 102 treesize of output 65 [2023-11-24 21:48:33,620 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-24 21:48:33,633 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-24 21:48:33,791 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-24 21:48:33,800 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-24 21:48:33,808 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-24 21:48:33,814 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-24 21:48:34,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:48:34,233 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-24 21:48:34,255 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-24 21:48:34,256 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-24 21:48:34,267 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-24 21:48:34,281 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-24 21:48:35,288 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 56 treesize of output 54 [2023-11-24 21:48:35,296 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 142 treesize of output 84 [2023-11-24 21:48:35,311 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-24 21:48:35,341 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-24 21:48:35,342 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 100 treesize of output 78 [2023-11-24 21:48:35,350 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 125 treesize of output 74 [2023-11-24 21:48:35,365 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 75 treesize of output 41 [2023-11-24 21:48:35,405 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-24 21:48:35,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2023-11-24 21:48:35,561 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 137 treesize of output 97 [2023-11-24 21:48:35,577 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 101 treesize of output 69 [2023-11-24 21:48:35,739 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-24 21:48:35,739 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-24 21:48:35,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 21:48:35,907 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-24 21:48:35,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:48:36,223 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_863 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (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|)) (.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |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|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_856) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_865) (select (select (store (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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_863) .cse1) .cse2)) (+ (select (select (store (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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_857) .cse1) .cse2) 4)))))) is different from false [2023-11-24 21:48:39,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_863 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse4)) (.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |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|)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |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|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_856) .cse0 v_ArrVal_865) (select (select (store (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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse0 v_ArrVal_863) .cse2) .cse3)) (+ (select (select (store (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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse0 v_ArrVal_857) .cse2) .cse3) 4))))))) is different from false [2023-11-24 21:48:39,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:48:39,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2023-11-24 21:48:39,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_875 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24| Int) (v_ArrVal_857 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_863 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= .cse0 (select v_arrayElimArr_5 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24| v_ArrVal_875) .cse2) .cse0)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |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|))) (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24| v_ArrVal_856) .cse1 v_ArrVal_865) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24| (store v_ArrVal_875 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse1 v_ArrVal_863) .cse3) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_24| v_arrayElimArr_5) .cse1 v_ArrVal_857) .cse3) .cse4) 4)))))))))) is different from false [2023-11-24 21:48:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741873864] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:48:39,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:48:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2023-11-24 21:48:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889212919] [2023-11-24 21:48:39,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:48:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-24 21:48:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-24 21:48:39,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2255, Unknown=70, NotChecked=294, Total=2756 [2023-11-24 21:48:39,741 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 45 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 35 states have internal predecessors, (46), 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)