./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 23:45:28,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:45:28,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 23:45:28,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:45:28,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:45:28,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:45:28,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:45:28,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:45:28,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:45:28,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:45:28,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:45:28,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:45:28,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:45:28,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:45:28,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:45:28,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:45:28,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:45:28,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:45:28,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 23:45:28,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:45:28,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:45:28,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:45:28,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:45:28,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:45:28,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:45:28,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:45:28,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:45:28,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:45:28,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:45:28,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:45:28,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:45:28,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:45:28,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:45:28,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:45:28,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:45:28,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:45:28,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 23:45:28,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 23:45:28,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:45:28,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:45:28,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:45:28,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:45:28,341 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2024-10-23 23:45:28,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:45:28,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:45:28,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:45:28,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:45:28,629 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:45:28,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-10-23 23:45:30,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:45:30,308 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:45:30,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-10-23 23:45:30,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afb5e661/f82d696e53dd4f82b6eae080b428f31f/FLAG932994ffa [2024-10-23 23:45:30,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afb5e661/f82d696e53dd4f82b6eae080b428f31f [2024-10-23 23:45:30,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:45:30,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:45:30,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:45:30,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:45:30,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:45:30,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e9a24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30, skipping insertion in model container [2024-10-23 23:45:30,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:45:30,716 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2024-10-23 23:45:30,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:45:30,729 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:45:30,778 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2024-10-23 23:45:30,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:45:30,810 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:45:30,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30 WrapperNode [2024-10-23 23:45:30,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:45:30,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:45:30,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:45:30,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:45:30,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,867 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2024-10-23 23:45:30,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:45:30,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:45:30,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:45:30,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:45:30,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,914 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2024-10-23 23:45:30,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:45:30,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:45:30,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:45:30,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:45:30,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (1/1) ... [2024-10-23 23:45:30,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:45:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:30,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 23:45:30,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 23:45:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 23:45:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 23:45:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 23:45:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-23 23:45:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-23 23:45:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-23 23:45:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-23 23:45:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-23 23:45:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 23:45:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:45:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:45:31,166 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:45:31,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:45:31,357 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-23 23:45:31,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:45:31,405 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:45:31,406 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 23:45:31,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:45:31 BoogieIcfgContainer [2024-10-23 23:45:31,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:45:31,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:45:31,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:45:31,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:45:31,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:45:30" (1/3) ... [2024-10-23 23:45:31,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4b7907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:45:31, skipping insertion in model container [2024-10-23 23:45:31,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:30" (2/3) ... [2024-10-23 23:45:31,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4b7907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:45:31, skipping insertion in model container [2024-10-23 23:45:31,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:45:31" (3/3) ... [2024-10-23 23:45:31,415 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2024-10-23 23:45:31,430 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:45:31,430 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:45:31,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:45:31,483 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aabc3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:45:31,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:45:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-23 23:45:31,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:31,497 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:31,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2024-10-23 23:45:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249972343] [2024-10-23 23:45:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:45:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:31,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:31,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249972343] [2024-10-23 23:45:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249972343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:31,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 23:45:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969732989] [2024-10-23 23:45:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 23:45:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 23:45:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:45:31,888 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:31,942 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2024-10-23 23:45:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 23:45:31,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-23 23:45:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:31,951 INFO L225 Difference]: With dead ends: 54 [2024-10-23 23:45:31,951 INFO L226 Difference]: Without dead ends: 23 [2024-10-23 23:45:31,954 INFO L431 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 [2024-10-23 23:45:31,957 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:31,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-23 23:45:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-23 23:45:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-23 23:45:31,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2024-10-23 23:45:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:32,000 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-23 23:45:32,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-23 23:45:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-23 23:45:32,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:32,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 23:45:32,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2024-10-23 23:45:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127772157] [2024-10-23 23:45:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:45:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127772157] [2024-10-23 23:45:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127772157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:32,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:45:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765161141] [2024-10-23 23:45:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:32,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:45:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:32,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:45:32,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:32,231 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:32,280 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-10-23 23:45:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:45:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-23 23:45:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:32,282 INFO L225 Difference]: With dead ends: 43 [2024-10-23 23:45:32,282 INFO L226 Difference]: Without dead ends: 26 [2024-10-23 23:45:32,283 INFO L431 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 [2024-10-23 23:45:32,284 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:32,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-23 23:45:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-23 23:45:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-23 23:45:32,295 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2024-10-23 23:45:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:32,295 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-23 23:45:32,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-23 23:45:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 23:45:32,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:32,297 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 23:45:32,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2024-10-23 23:45:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306035864] [2024-10-23 23:45:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:45:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306035864] [2024-10-23 23:45:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306035864] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848560601] [2024-10-23 23:45:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:32,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:32,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 23:45:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:32,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-23 23:45:32,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:33,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-23 23:45:33,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-23 23:45:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-23 23:45:33,207 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 53 treesize of output 21 [2024-10-23 23:45:33,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-23 23:45:33,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-23 23:45:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 23:45:33,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 23:45:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848560601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 23:45:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2024-10-23 23:45:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438421144] [2024-10-23 23:45:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:33,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-23 23:45:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-23 23:45:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-23 23:45:33,319 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 23:45:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:33,528 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-23 23:45:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-23 23:45:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-23 23:45:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:33,530 INFO L225 Difference]: With dead ends: 37 [2024-10-23 23:45:33,530 INFO L226 Difference]: Without dead ends: 35 [2024-10-23 23:45:33,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-23 23:45:33,533 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:33,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-23 23:45:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2024-10-23 23:45:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-23 23:45:33,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2024-10-23 23:45:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:33,542 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-23 23:45:33,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 23:45:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-23 23:45:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:45:33,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:33,543 INFO L215 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] [2024-10-23 23:45:33,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 23:45:33,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:33,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -730705930, now seen corresponding path program 1 times [2024-10-23 23:45:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:33,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608691724] [2024-10-23 23:45:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:45:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608691724] [2024-10-23 23:45:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608691724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181117612] [2024-10-23 23:45:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:34,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:34,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:34,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 23:45:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-23 23:45:34,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:34,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-23 23:45:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:45:34,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:45:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181117612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:45:34,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:45:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2024-10-23 23:45:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724448441] [2024-10-23 23:45:34,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:34,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-23 23:45:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-23 23:45:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-23 23:45:34,376 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-23 23:45:38,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:45:42,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:45:46,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:45:50,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:45:54,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:45:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:54,613 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-23 23:45:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 23:45:54,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2024-10-23 23:45:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:54,615 INFO L225 Difference]: With dead ends: 38 [2024-10-23 23:45:54,615 INFO L226 Difference]: Without dead ends: 29 [2024-10-23 23:45:54,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-23 23:45:54,616 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:54,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-10-23 23:45:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-23 23:45:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-23 23:45:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-23 23:45:54,627 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2024-10-23 23:45:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:54,628 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-23 23:45:54,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-23 23:45:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-23 23:45:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:45:54,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:54,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:54,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 23:45:54,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-23 23:45:54,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2024-10-23 23:45:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320461341] [2024-10-23 23:45:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:55,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320461341] [2024-10-23 23:45:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320461341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814222622] [2024-10-23 23:45:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:56,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:56,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:56,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:56,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 23:45:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:56,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-23 23:45:56,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:56,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:45:56,561 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-23 23:45:56,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-23 23:45:56,614 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 [2024-10-23 23:45:56,699 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-23 23:45:56,700 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 41 treesize of output 34 [2024-10-23 23:45:56,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-23 23:45:56,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-23 23:45:56,964 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-23 23:45:56,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2024-10-23 23:45:56,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-23 23:45:57,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-23 23:45:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:45:57,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 15 [2024-10-23 23:45:57,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-23 23:45:57,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-23 23:45:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:45:57,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:58,327 INFO L349 Elim1Store]: treesize reduction 159, result has 48.5 percent of original size [2024-10-23 23:45:58,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 293 [2024-10-23 23:45:58,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:58,388 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 388 treesize of output 408 [2024-10-23 23:45:58,446 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 6 treesize of output 4 [2024-10-23 23:45:58,603 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 6 treesize of output 4 [2024-10-23 23:45:58,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:45:58,724 INFO L349 Elim1Store]: treesize reduction 36, result has 45.5 percent of original size [2024-10-23 23:45:58,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 200 [2024-10-23 23:45:58,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:58,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 489 treesize of output 451 [2024-10-23 23:45:58,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:45:58,887 INFO L349 Elim1Store]: treesize reduction 68, result has 52.4 percent of original size [2024-10-23 23:45:58,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 439 treesize of output 484 [2024-10-23 23:45:59,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:59,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2024-10-23 23:45:59,864 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:45:59,874 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-10-23 23:45:59,874 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 92 treesize of output 86 [2024-10-23 23:45:59,879 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:45:59,880 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 88 treesize of output 82 [2024-10-23 23:45:59,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-23 23:45:59,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_636 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_636) .cse2) .cse1) .cse2))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_append_~data#1|)) (not (= .cse1 4)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_636 (Array Int Int))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_636) .cse2) .cse1) .cse2))))))) is different from false [2024-10-23 23:45:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814222622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:59,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:45:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 37 [2024-10-23 23:45:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049087414] [2024-10-23 23:45:59,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-23 23:45:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-23 23:45:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1838, Unknown=10, NotChecked=86, Total=2070 [2024-10-23 23:45:59,917 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:46:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:00,980 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-10-23 23:46:00,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-23 23:46:00,980 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-10-23 23:46:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:00,981 INFO L225 Difference]: With dead ends: 54 [2024-10-23 23:46:00,981 INFO L226 Difference]: Without dead ends: 46 [2024-10-23 23:46:00,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=235, Invalid=2951, Unknown=10, NotChecked=110, Total=3306 [2024-10-23 23:46:00,984 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 35 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:00,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 329 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 23:46:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-23 23:46:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-10-23 23:46:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) [2024-10-23 23:46:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-23 23:46:00,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 27 [2024-10-23 23:46:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:00,992 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-23 23:46:00,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:46:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-23 23:46:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 23:46:00,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:00,993 INFO L215 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] [2024-10-23 23:46:01,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 23:46:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:01,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2024-10-23 23:46:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530083693] [2024-10-23 23:46:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530083693] [2024-10-23 23:46:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530083693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492809686] [2024-10-23 23:46:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:02,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:02,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 23:46:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:03,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-10-23 23:46:03,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:03,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:03,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-23 23:46:03,326 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:46:03,326 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 [2024-10-23 23:46:03,397 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 [2024-10-23 23:46:03,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-23 23:46:03,486 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 27 treesize of output 15 [2024-10-23 23:46:03,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:46:03,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-23 23:46:03,620 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 [2024-10-23 23:46:03,623 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 [2024-10-23 23:46:03,796 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-23 23:46:03,797 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 20 treesize of output 22 [2024-10-23 23:46:03,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:46:03,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:46:04,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-23 23:46:04,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-23 23:46:04,294 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 25 treesize of output 15 [2024-10-23 23:46:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:46:04,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-23 23:46:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:04,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:04,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2024-10-23 23:46:04,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| v_arrayElimCell_55 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_812) .cse0) .cse1)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_arrayElimCell_55) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| v_arrayElimCell_55 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_812) .cse0) .cse1)))))) is different from false [2024-10-23 23:46:04,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (= .cse0 v_arrayElimCell_55) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| v_arrayElimCell_55 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_812) .cse1) .cse2)))) (or (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse3) .cse3)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| v_arrayElimCell_55 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_812) .cse1) .cse2)))))) is different from false [2024-10-23 23:46:04,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_55 Int)) (= (select (select (store (store |c_#memory_int#2| v_arrayElimCell_55 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_812) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) .cse3))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (= (select (select (store (store |c_#memory_int#2| v_arrayElimCell_55 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_812) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= .cse2 v_arrayElimCell_55))))) is different from false [2024-10-23 23:46:04,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492809686] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:04,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:46:04,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2024-10-23 23:46:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809334813] [2024-10-23 23:46:04,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:04,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-23 23:46:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-23 23:46:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2079, Unknown=19, NotChecked=282, Total=2550 [2024-10-23 23:46:04,987 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:46:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:06,046 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-10-23 23:46:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-23 23:46:06,047 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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 29 [2024-10-23 23:46:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:06,047 INFO L225 Difference]: With dead ends: 56 [2024-10-23 23:46:06,048 INFO L226 Difference]: Without dead ends: 54 [2024-10-23 23:46:06,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=314, Invalid=3585, Unknown=19, NotChecked=372, Total=4290 [2024-10-23 23:46:06,051 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:06,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 237 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 23:46:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-23 23:46:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-10-23 23:46:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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) [2024-10-23 23:46:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-23 23:46:06,061 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 29 [2024-10-23 23:46:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:06,061 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-23 23:46:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:46:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-23 23:46:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-23 23:46:06,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:06,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:06,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-23 23:46:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:06,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2024-10-23 23:46:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714151859] [2024-10-23 23:46:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714151859] [2024-10-23 23:46:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714151859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971884202] [2024-10-23 23:46:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:07,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:07,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:07,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 23:46:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:07,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-23 23:46:07,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:07,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:07,621 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:46:07,621 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 [2024-10-23 23:46:07,660 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 [2024-10-23 23:46:07,705 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-23 23:46:07,706 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 [2024-10-23 23:46:07,745 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 [2024-10-23 23:46:07,748 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 [2024-10-23 23:46:07,810 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-23 23:46:07,810 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 [2024-10-23 23:46:07,914 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-23 23:46:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-10-23 23:46:07,936 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-10-23 23:46:07,936 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 3 case distinctions, treesize of input 68 treesize of output 74 [2024-10-23 23:46:07,944 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 22 treesize of output 16 [2024-10-23 23:46:07,962 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 [2024-10-23 23:46:07,992 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 [2024-10-23 23:46:07,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-23 23:46:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 23:46:07,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971884202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:08,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:46:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 31 [2024-10-23 23:46:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598437162] [2024-10-23 23:46:08,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:08,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-23 23:46:08,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-23 23:46:08,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1013, Unknown=13, NotChecked=0, Total=1122 [2024-10-23 23:46:08,176 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 31 states, 25 states have (on average 1.64) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-23 23:46:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:08,783 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-10-23 23:46:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-23 23:46:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 1.64) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-10-23 23:46:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:08,785 INFO L225 Difference]: With dead ends: 80 [2024-10-23 23:46:08,785 INFO L226 Difference]: Without dead ends: 77 [2024-10-23 23:46:08,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=1785, Unknown=13, NotChecked=0, Total=1980 [2024-10-23 23:46:08,786 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 65 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:08,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 243 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 23:46:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-23 23:46:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2024-10-23 23:46:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 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) [2024-10-23 23:46:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-23 23:46:08,806 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 31 [2024-10-23 23:46:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-23 23:46:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 1.64) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-23 23:46:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-23 23:46:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-23 23:46:08,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:08,810 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:08,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-23 23:46:09,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:09,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:09,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2024-10-23 23:46:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:09,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109143850] [2024-10-23 23:46:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:10,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109143850] [2024-10-23 23:46:10,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109143850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525758592] [2024-10-23 23:46:10,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-23 23:46:10,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:10,351 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:10,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-23 23:46:10,691 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-23 23:46:10,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-23 23:46:10,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-10-23 23:46:10,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:10,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:10,876 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-10-23 23:46:10,877 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-10-23 23:46:10,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-23 23:46:10,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-23 23:46:10,917 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2024-10-23 23:46:10,920 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2024-10-23 23:46:10,975 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-23 23:46:10,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-10-23 23:46:10,988 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2024-10-23 23:46:10,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-10-23 23:46:11,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-10-23 23:46:11,010 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-10-23 23:46:11,026 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-23 23:46:11,026 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 48 treesize of output 23 [2024-10-23 23:46:11,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:11,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-23 23:46:11,049 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-23 23:46:11,050 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-23 23:46:11,070 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-23 23:46:11,072 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-23 23:46:11,094 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0))))) is different from false [2024-10-23 23:46:11,096 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0))))) is different from true [2024-10-23 23:46:11,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:11,124 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-23 23:46:11,125 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 56 treesize of output 45 [2024-10-23 23:46:11,154 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-10-23 23:46:11,155 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 3 case distinctions, treesize of input 35 treesize of output 73 [2024-10-23 23:46:11,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0)))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| .cse1))) (let ((.cse5 (= 0 (select .cse8 0))) (.cse6 (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (or .cse5 .cse6)) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= (select .cse7 0) 0) (or (= .cse8 .cse7) .cse5 .cse6)))))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-10-23 23:46:11,262 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0)))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| .cse1))) (let ((.cse5 (= 0 (select .cse8 0))) (.cse6 (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (or .cse5 .cse6)) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= (select .cse7 0) 0) (or (= .cse8 .cse7) .cse5 .cse6)))))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-10-23 23:46:11,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse4 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_14| .cse5)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse3 .cse0) .cse4) (and .cse4 (= 0 (select .cse3 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-23 23:46:11,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse4 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_14| .cse5)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse3 .cse0) .cse4) (and .cse4 (= 0 (select .cse3 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-23 23:46:11,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse4 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_14| .cse5)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse3 .cse0) .cse4) (and .cse4 (= 0 (select .cse3 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2024-10-23 23:46:11,569 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse4 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_14| .cse5)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse3 .cse0) .cse4) (and .cse4 (= 0 (select .cse3 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2024-10-23 23:46:11,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse4 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_14| .cse5)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse3 .cse0) .cse4) (and .cse4 (= 0 (select .cse3 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse9) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-23 23:46:11,771 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse4 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_14| .cse5)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse3 .cse0) .cse4) (and .cse4 (= 0 (select .cse3 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse9) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-23 23:46:11,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (let ((.cse6 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_#valid_BEFORE_CALL_14| .cse7)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse5 .cse0) .cse6) (and .cse6 (= 0 (select .cse5 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse8) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-23 23:46:11,898 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (let ((.cse6 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_#valid_BEFORE_CALL_14| .cse7)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse5 .cse0) .cse6) (and .cse6 (= 0 (select .cse5 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse8) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-23 23:46:11,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:46:11,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:46:11,957 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-10-23 23:46:11,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 196 [2024-10-23 23:46:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-10-23 23:46:11,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:12,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525758592] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:12,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:46:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 33 [2024-10-23 23:46:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679085969] [2024-10-23 23:46:12,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:12,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-23 23:46:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:12,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-23 23:46:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=740, Unknown=22, NotChecked=704, Total=1560 [2024-10-23 23:46:12,288 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 33 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 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) [2024-10-23 23:46:12,454 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-10-23 23:46:12,455 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-10-23 23:46:12,458 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2024-10-23 23:46:12,459 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2024-10-23 23:46:12,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select .cse5 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (= 1 (select |c_#valid| .cse4)) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0) (= .cse6 .cse7) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0)) (= .cse8 .cse5) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-10-23 23:46:12,465 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select .cse5 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse0) (= 1 (select |c_#valid| .cse4)) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0) (= .cse6 .cse7) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0)) (= .cse8 .cse5) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-10-23 23:46:12,472 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-23 23:46:12,473 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-23 23:46:12,476 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-23 23:46:12,478 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-23 23:46:12,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 0)))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse4) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|))) is different from false [2024-10-23 23:46:12,488 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 0)))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse4) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|))) is different from true [2024-10-23 23:46:12,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse13 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse4 0)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse9 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse13)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse13))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse1) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 .cse6) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse7) 0)))) (= .cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11)) (= .cse12 .cse4) (= .cse13 .cse9) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| .cse1))) (let ((.cse14 (= 0 (select .cse17 0))) (.cse15 (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (or .cse14 .cse15)) (let ((.cse16 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= (select .cse16 0) 0) (or (= .cse17 .cse16) .cse14 .cse15)))))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11)) (= (select .cse6 0) 0))))) is different from false [2024-10-23 23:46:12,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse13 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse4 0)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse9 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse13)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse13))) (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_14| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_#valid_BEFORE_CALL_14| .cse0)))) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse1) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 .cse6) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse7) 0)))) (= .cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11)) (= .cse12 .cse4) (= .cse13 .cse9) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| .cse1))) (let ((.cse14 (= 0 (select .cse17 0))) (.cse15 (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (or .cse14 .cse15)) (let ((.cse16 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= (select .cse16 0) 0) (or (= .cse17 .cse16) .cse14 .cse15)))))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11)) (= (select .cse6 0) 0))))) is different from true [2024-10-23 23:46:12,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse4 0)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse16 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse12 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse16)) (.cse14 (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse16))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse6 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_#valid_BEFORE_CALL_14| .cse7)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse5 .cse0) .cse6) (and .cse6 (= 0 (select .cse5 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse8 .cse9) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse11 (select |v_#valid_BEFORE_CALL_13| .cse11)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse10) 0)))) (= .cse12 (select (select |c_#memory_$Pointer$#2.offset| .cse13) .cse14)) (= .cse15 .cse4) (= .cse16 .cse12) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse14)) (= (select .cse9 0) 0)))))) is different from false [2024-10-23 23:46:12,512 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse4 0)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse16 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse12 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse16)) (.cse14 (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse16))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse6 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_#valid_BEFORE_CALL_14| .cse7)))) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0)))) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse2))) (or (and (= .cse5 .cse0) .cse6) (and .cse6 (= 0 (select .cse5 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse8 .cse9) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse11 (select |v_#valid_BEFORE_CALL_13| .cse11)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse10) 0)))) (= .cse12 (select (select |c_#memory_$Pointer$#2.offset| .cse13) .cse14)) (= .cse15 .cse4) (= .cse16 .cse12) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse14)) (= (select .cse9 0) 0)))))) is different from true [2024-10-23 23:46:12,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse7 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse8 (select |v_#valid_BEFORE_CALL_14| .cse8)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse6 .cse0) .cse7) (and .cse7 (= 0 (select .cse6 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10) .cse11) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse10) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse1 .cse12) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse13) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse14 (select |v_#valid_BEFORE_CALL_13| .cse14)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse13) 0)))) (= .cse15 .cse5) (= (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse11) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse12 0) 0) (= (select .cse15 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) is different from false [2024-10-23 23:46:12,521 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse7 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse8 (select |v_#valid_BEFORE_CALL_14| .cse8)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse6 .cse0) .cse7) (and .cse7 (= 0 (select .cse6 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10) .cse11) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse10) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse1 .cse12) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse13) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse14 (select |v_#valid_BEFORE_CALL_13| .cse14)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse13) 0)))) (= .cse15 .cse5) (= (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse11) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse12 0) 0) (= (select .cse15 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) is different from true [2024-10-23 23:46:12,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse1 (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse13 (select .cse15 0)) (.cse14 (select .cse9 0)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse7 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse8 (select |v_#valid_BEFORE_CALL_14| .cse8)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse6 .cse0) .cse7) (and .cse7 (= 0 (select .cse6 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse9 .cse10) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse12 (select |v_#valid_BEFORE_CALL_13| .cse12)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse11) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse14) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= .cse15 .cse5) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse13) .cse14)) (= (select .cse10 0) 0)))))) is different from false [2024-10-23 23:46:12,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse1 (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse13 (select .cse15 0)) (.cse14 (select .cse9 0)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse7 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse8 (select |v_#valid_BEFORE_CALL_14| .cse8)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse6 .cse0) .cse7) (and .cse7 (= 0 (select .cse6 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse9 .cse10) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse12 (select |v_#valid_BEFORE_CALL_13| .cse12)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse11) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse13) .cse14) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= .cse15 .cse5) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse13) .cse14)) (= (select .cse10 0) 0)))))) is different from true [2024-10-23 23:46:12,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse1 (select .cse4 0)) (.cse6 (select .cse10 0)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse6 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (let ((.cse8 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse9 (select |v_#valid_BEFORE_CALL_14| .cse9)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse7 .cse0) .cse8) (and .cse8 (= 0 (select .cse7 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse10 .cse11) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse13 (select |v_#valid_BEFORE_CALL_13| .cse13)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse12) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= .cse4 .cse5) (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse6)) (= (select .cse11 0) 0)))))) is different from false [2024-10-23 23:46:12,550 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse1 (select .cse4 0)) (.cse6 (select .cse10 0)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse6 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (let ((.cse8 (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_14| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_14| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_14|))) (store |v_old(#valid)_AFTER_CALL_19| .cse9 (select |v_#valid_BEFORE_CALL_14| .cse9)))) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0)))) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse3))) (or (and (= .cse7 .cse0) .cse8) (and .cse8 (= 0 (select .cse7 0))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse10 .cse11) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (v_arrayElimCell_75 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_75) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse13 (select |v_#valid_BEFORE_CALL_13| .cse13)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse12) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= .cse4 .cse5) (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse6)) (= (select .cse11 0) 0)))))) is different from true [2024-10-23 23:46:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:12,647 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-10-23 23:46:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-23 23:46:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2024-10-23 23:46:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:12,649 INFO L225 Difference]: With dead ends: 67 [2024-10-23 23:46:12,649 INFO L226 Difference]: Without dead ends: 54 [2024-10-23 23:46:12,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=847, Unknown=44, NotChecked=1738, Total=2756 [2024-10-23 23:46:12,650 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 760 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:12,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 760 Unchecked, 0.2s Time] [2024-10-23 23:46:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-23 23:46:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-23 23:46:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-10-23 23:46:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-10-23 23:46:12,661 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 31 [2024-10-23 23:46:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:12,662 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-23 23:46:12,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 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) [2024-10-23 23:46:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-10-23 23:46:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 23:46:12,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:12,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:12,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-23 23:46:12,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:12,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:12,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:12,864 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2024-10-23 23:46:12,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:12,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843797379] [2024-10-23 23:46:12,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:12,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843797379] [2024-10-23 23:46:15,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843797379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655561428] [2024-10-23 23:46:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:15,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:15,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-23 23:46:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:16,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 159 conjuncts are in the unsatisfiable core [2024-10-23 23:46:16,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:16,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:16,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-23 23:46:16,345 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-23 23:46:16,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-23 23:46:16,373 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:46:16,373 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 [2024-10-23 23:46:16,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-23 23:46:16,451 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 [2024-10-23 23:46:16,456 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 [2024-10-23 23:46:16,549 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-23 23:46:16,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 83 [2024-10-23 23:46:16,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-23 23:46:16,561 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 [2024-10-23 23:46:16,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-23 23:46:16,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-23 23:46:16,635 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 [2024-10-23 23:46:16,637 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 [2024-10-23 23:46:16,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:16,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-10-23 23:46:16,843 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-23 23:46:16,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2024-10-23 23:46:16,871 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-23 23:46:16,871 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 [2024-10-23 23:46:16,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:46:17,625 INFO L349 Elim1Store]: treesize reduction 68, result has 11.7 percent of original size [2024-10-23 23:46:17,625 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 4 case distinctions, treesize of input 203 treesize of output 112 [2024-10-23 23:46:17,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-23 23:46:17,637 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 56 treesize of output 20 [2024-10-23 23:46:17,644 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 83 treesize of output 34 [2024-10-23 23:46:17,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2024-10-23 23:46:17,762 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 50 treesize of output 30 [2024-10-23 23:46:17,874 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 27 treesize of output 15 [2024-10-23 23:46:17,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-23 23:46:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:17,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:18,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#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#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1346) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1352) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1348) .cse0) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1349) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1350) .cse0) .cse1) 4)))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_1346 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_1346)))) is different from false [2024-10-23 23:46:18,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1350 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1362)) (.cse6 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1361)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select .cse6 .cse7) .cse0)) (.cse3 (select (select .cse1 .cse7) .cse0))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse3))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#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#2| .cse2 v_ArrVal_1346) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1352) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_1347) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1348) .cse4) .cse5)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1349) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1350) .cse4) .cse5) 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|) 0)) (not (= (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1360) .cse2) .cse3 (select v_ArrVal_1346 .cse3)) v_ArrVal_1346)) (not (= (select (select .cse6 .cse2) .cse3) .cse7)))))) is different from false [2024-10-23 23:46:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655561428] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:18,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:46:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2024-10-23 23:46:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531758438] [2024-10-23 23:46:18,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:18,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-23 23:46:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-23 23:46:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2900, Unknown=3, NotChecked=218, Total=3306 [2024-10-23 23:46:18,841 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:46:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:21,129 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-23 23:46:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-23 23:46:21,130 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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 32 [2024-10-23 23:46:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:21,131 INFO L225 Difference]: With dead ends: 66 [2024-10-23 23:46:21,131 INFO L226 Difference]: Without dead ends: 64 [2024-10-23 23:46:21,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=371, Invalid=5184, Unknown=3, NotChecked=294, Total=5852 [2024-10-23 23:46:21,135 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:21,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 265 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 23:46:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-23 23:46:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2024-10-23 23:46:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-10-23 23:46:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-10-23 23:46:21,154 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 32 [2024-10-23 23:46:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:21,154 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-23 23:46:21,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:46:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-10-23 23:46:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-23 23:46:21,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:21,158 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:21,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-23 23:46:21,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:21,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2024-10-23 23:46:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668481378] [2024-10-23 23:46:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668481378] [2024-10-23 23:46:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668481378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280124467] [2024-10-23 23:46:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:23,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:23,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:23,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-23 23:46:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:23,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-10-23 23:46:23,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:23,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:23,691 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:46:23,691 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 [2024-10-23 23:46:23,734 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 [2024-10-23 23:46:23,740 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 [2024-10-23 23:46:23,804 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-23 23:46:23,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 53 [2024-10-23 23:46:23,810 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 [2024-10-23 23:46:23,861 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 [2024-10-23 23:46:23,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 [2024-10-23 23:46:23,867 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 [2024-10-23 23:46:24,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:24,032 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 [2024-10-23 23:46:24,044 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-23 23:46:24,045 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 [2024-10-23 23:46:24,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:46:24,608 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-23 23:46:24,609 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 65 [2024-10-23 23:46:24,624 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-10-23 23:46:24,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 95 [2024-10-23 23:46:24,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:24,630 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 0 case distinctions, treesize of input 83 treesize of output 65 [2024-10-23 23:46:24,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:24,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2024-10-23 23:46:24,792 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-23 23:46:24,793 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 15 treesize of output 7 [2024-10-23 23:46:24,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:24,796 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 27 treesize of output 7 [2024-10-23 23:46:24,861 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 67 treesize of output 43 [2024-10-23 23:46:24,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-23 23:46:24,868 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 40 treesize of output 19 [2024-10-23 23:46:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:24,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:25,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| Int) (v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| v_ArrVal_1543)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| v_ArrVal_1542)) (.cse3 (select (select .cse4 .cse9) .cse7))) (let ((.cse6 (select .cse8 .cse3)) (.cse5 (select (select .cse8 .cse9) .cse7))) (or (not (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| .cse3 (store (select .cse4 .cse3) .cse5 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| v_ArrVal_1534))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse6 .cse5 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37| v_ArrVal_1537) .cse1) .cse2))) .cse1))) (not (= .cse7 (select .cse6 .cse5))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_37|) 0))))))) is different from false [2024-10-23 23:46:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280124467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:25,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:46:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 42 [2024-10-23 23:46:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697868873] [2024-10-23 23:46:25,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:25,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-23 23:46:25,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-23 23:46:25,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2104, Unknown=5, NotChecked=92, Total=2352 [2024-10-23 23:46:25,326 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 42 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-23 23:46:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:27,267 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2024-10-23 23:46:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-23 23:46:27,268 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-23 23:46:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:27,270 INFO L225 Difference]: With dead ends: 83 [2024-10-23 23:46:27,270 INFO L226 Difference]: Without dead ends: 80 [2024-10-23 23:46:27,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=404, Invalid=5295, Unknown=5, NotChecked=148, Total=5852 [2024-10-23 23:46:27,272 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:27,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 339 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 23:46:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-23 23:46:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2024-10-23 23:46:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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) [2024-10-23 23:46:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-10-23 23:46:27,287 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 34 [2024-10-23 23:46:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-10-23 23:46:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-23 23:46:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-10-23 23:46:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-23 23:46:27,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:27,289 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:27,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-23 23:46:27,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-23 23:46:27,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:27,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1818343490, now seen corresponding path program 1 times [2024-10-23 23:46:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316206801] [2024-10-23 23:46:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 23:46:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-23 23:46:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-23 23:46:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316206801] [2024-10-23 23:46:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316206801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885365711] [2024-10-23 23:46:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:27,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:27,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:27,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:27,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-23 23:46:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:27,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 23:46:27,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 23:46:27,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 23:46:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885365711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:27,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 23:46:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-23 23:46:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042527869] [2024-10-23 23:46:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:27,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:46:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:46:27,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:46:27,813 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 23:46:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:27,838 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-10-23 23:46:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:46:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-23 23:46:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:27,840 INFO L225 Difference]: With dead ends: 74 [2024-10-23 23:46:27,840 INFO L226 Difference]: Without dead ends: 35 [2024-10-23 23:46:27,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:46:27,841 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:27,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-23 23:46:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-23 23:46:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-23 23:46:27,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2024-10-23 23:46:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:27,850 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-23 23:46:27,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 23:46:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-23 23:46:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-23 23:46:27,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:27,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:27,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-23 23:46:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:28,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash -742312008, now seen corresponding path program 2 times [2024-10-23 23:46:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479385483] [2024-10-23 23:46:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479385483] [2024-10-23 23:46:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479385483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014555650] [2024-10-23 23:46:29,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-23 23:46:29,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:29,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:29,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-23 23:46:29,890 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-23 23:46:29,890 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-23 23:46:29,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 161 conjuncts are in the unsatisfiable core [2024-10-23 23:46:29,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:29,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:29,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-23 23:46:30,178 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-23 23:46:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-23 23:46:30,196 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:46:30,197 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 [2024-10-23 23:46:30,246 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 [2024-10-23 23:46:30,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-23 23:46:30,259 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 [2024-10-23 23:46:30,350 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-23 23:46:30,351 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 142 treesize of output 72 [2024-10-23 23:46:30,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-23 23:46:30,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-23 23:46:30,448 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-23 23:46:30,448 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 79 treesize of output 38 [2024-10-23 23:46:30,453 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 [2024-10-23 23:46:30,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-23 23:46:30,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-23 23:46:30,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-23 23:46:30,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:30,678 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-23 23:46:30,678 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 87 treesize of output 64 [2024-10-23 23:46:30,701 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-23 23:46:30,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-10-23 23:46:30,724 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-23 23:46:30,724 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 [2024-10-23 23:46:30,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-23 23:46:31,339 INFO L349 Elim1Store]: treesize reduction 108, result has 43.2 percent of original size [2024-10-23 23:46:31,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 110 [2024-10-23 23:46:31,419 INFO L349 Elim1Store]: treesize reduction 118, result has 36.2 percent of original size [2024-10-23 23:46:31,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 164 treesize of output 145 [2024-10-23 23:46:31,473 INFO L349 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2024-10-23 23:46:31,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 131 [2024-10-23 23:46:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-10-23 23:46:31,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:46:31,533 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 20 treesize of output 1 [2024-10-23 23:46:31,635 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-23 23:46:31,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 36 [2024-10-23 23:46:32,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2024-10-23 23:46:32,420 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-10-23 23:46:32,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 73 [2024-10-23 23:46:32,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2024-10-23 23:46:32,434 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 31 treesize of output 24