./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-simple/sll2c_append_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:37:23,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:37:23,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:37:23,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:37:23,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:37:23,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:37:23,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:37:23,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:37:23,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:37:23,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:37:23,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:37:23,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:37:23,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:37:23,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:37:23,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:37:23,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:37:23,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:37:23,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:37:23,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:37:23,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:37:23,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:37:23,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:37:23,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:37:23,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:37:23,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:37:23,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:37:23,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:37:23,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:37:23,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:37:23,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:37:23,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:37:23,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:37:23,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:37:23,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:37:23,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:37:23,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:37:23,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:37:23,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:37:23,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:37:23,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:37:23,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:37:23,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:37:23,565 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-16 06:37:23,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:37:23,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:37:23,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:37:23,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:37:23,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:37:23,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-16 06:37:25,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:37:25,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:37:25,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-16 06:37:25,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a56dcd4/54ccfa937feb42ccb9467ff713e43568/FLAGe215a95a8 [2024-11-16 06:37:25,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a56dcd4/54ccfa937feb42ccb9467ff713e43568 [2024-11-16 06:37:25,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:37:25,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:37:25,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:37:25,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:37:25,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:37:25,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:25" (1/1) ... [2024-11-16 06:37:25,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419196f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:25, skipping insertion in model container [2024-11-16 06:37:25,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:25" (1/1) ... [2024-11-16 06:37:25,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:37:26,225 WARN L250 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_unequal.i[24587,24600] [2024-11-16 06:37:26,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:37:26,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:37:26,265 WARN L250 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_unequal.i[24587,24600] [2024-11-16 06:37:26,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:37:26,296 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:37:26,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26 WrapperNode [2024-11-16 06:37:26,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:37:26,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:37:26,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:37:26,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:37:26,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,335 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2024-11-16 06:37:26,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:37:26,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:37:26,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:37:26,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:37:26,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,367 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-11-16 06:37:26,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:37:26,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:37:26,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:37:26,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:37:26,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (1/1) ... [2024-11-16 06:37:26,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:37:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:26,412 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-11-16 06:37:26,418 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-11-16 06:37:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:37:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:37:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 06:37:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:37:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:37:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 06:37:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-16 06:37:26,458 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-16 06:37:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:37:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:37:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 06:37:26,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 06:37:26,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-16 06:37:26,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:37:26,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:37:26,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 06:37:26,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:37:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:37:26,563 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:37:26,565 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:37:26,692 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-16 06:37:26,702 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-16 06:37:26,717 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-16 06:37:26,718 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:37:26,727 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:37:26,728 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:37:26,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:26 BoogieIcfgContainer [2024-11-16 06:37:26,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:37:26,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:37:26,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:37:26,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:37:26,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:37:25" (1/3) ... [2024-11-16 06:37:26,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d617ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:26, skipping insertion in model container [2024-11-16 06:37:26,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:26" (2/3) ... [2024-11-16 06:37:26,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d617ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:26, skipping insertion in model container [2024-11-16 06:37:26,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:26" (3/3) ... [2024-11-16 06:37:26,734 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-16 06:37:26,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:37:26,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:37:26,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:37:26,814 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;@3f941082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:37:26,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:37:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:37:26,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:26,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:26,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:26,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1897977669, now seen corresponding path program 1 times [2024-11-16 06:37:26,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:26,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657244611] [2024-11-16 06:37:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 06:37:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 06:37:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657244611] [2024-11-16 06:37:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657244611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:27,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:37:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143426962] [2024-11-16 06:37:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:37:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:37:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:27,117 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:27,166 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-16 06:37:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:37:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 26 [2024-11-16 06:37:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:27,173 INFO L225 Difference]: With dead ends: 77 [2024-11-16 06:37:27,173 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 06:37:27,175 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-11-16 06:37:27,177 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:27,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 06:37:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 06:37:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-16 06:37:27,206 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 26 [2024-11-16 06:37:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:27,209 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-16 06:37:27,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-16 06:37:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 06:37:27,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:27,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:27,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:37:27,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:27,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash 43509233, now seen corresponding path program 1 times [2024-11-16 06:37:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488131885] [2024-11-16 06:37:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 06:37:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 06:37:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:27,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488131885] [2024-11-16 06:37:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488131885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:27,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:37:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391346283] [2024-11-16 06:37:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:37:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:37:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:37:27,409 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:27,443 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-11-16 06:37:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:37:27,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 28 [2024-11-16 06:37:27,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:27,467 INFO L225 Difference]: With dead ends: 62 [2024-11-16 06:37:27,468 INFO L226 Difference]: Without dead ends: 37 [2024-11-16 06:37:27,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:37:27,469 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:27,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-16 06:37:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-16 06:37:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-16 06:37:27,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 28 [2024-11-16 06:37:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-16 06:37:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-16 06:37:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 06:37:27,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:27,477 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:37:27,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:27,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1276472772, now seen corresponding path program 1 times [2024-11-16 06:37:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289917163] [2024-11-16 06:37:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:37:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:37:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 06:37:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289917163] [2024-11-16 06:37:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289917163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786016902] [2024-11-16 06:37:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:27,893 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-11-16 06:37:27,896 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-11-16 06:37:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:28,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:37:28,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:28,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-16 06:37:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:37:28,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 06:37:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786016902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:37:28,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:37:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-16 06:37:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971996254] [2024-11-16 06:37:28,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:37:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:37:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:37:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:37:28,278 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 06:37:32,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:36,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:40,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:44,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:48,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:48,522 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-11-16 06:37:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 06:37:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 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 37 [2024-11-16 06:37:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:48,523 INFO L225 Difference]: With dead ends: 54 [2024-11-16 06:37:48,524 INFO L226 Difference]: Without dead ends: 42 [2024-11-16 06:37:48,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:37:48,525 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:48,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 290 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-11-16 06:37:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-16 06:37:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-16 06:37:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-16 06:37:48,534 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 37 [2024-11-16 06:37:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:48,534 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-16 06:37:48,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 06:37:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-16 06:37:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 06:37:48,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:48,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:48,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:37:48,740 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-11-16 06:37:48,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:48,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1822886309, now seen corresponding path program 1 times [2024-11-16 06:37:48,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193912224] [2024-11-16 06:37:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:37:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:37:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:37:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193912224] [2024-11-16 06:37:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193912224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419723633] [2024-11-16 06:37:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:49,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:49,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:49,565 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-11-16 06:37:49,569 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-11-16 06:37:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:49,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-16 06:37:49,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:49,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:37:49,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-16 06:37:50,061 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:37:50,061 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-11-16 06:37:50,143 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-11-16 06:37:50,154 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 25 treesize of output 13 [2024-11-16 06:37:50,303 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 06:37:50,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-16 06:37:50,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2024-11-16 06:37:50,395 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-11-16 06:37:50,400 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 17 treesize of output 3 [2024-11-16 06:37:50,403 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-11-16 06:37:50,521 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:37:50,522 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 26 treesize of output 29 [2024-11-16 06:37:50,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-16 06:37:50,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:50,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-16 06:37:50,556 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-16 06:37:50,556 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-11-16 06:37:50,924 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 0 case distinctions, treesize of input 72 treesize of output 47 [2024-11-16 06:37:50,933 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 34 treesize of output 21 [2024-11-16 06:37:50,936 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-11-16 06:37:50,970 INFO L349 Elim1Store]: treesize reduction 59, result has 38.5 percent of original size [2024-11-16 06:37:50,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2024-11-16 06:37:50,978 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 45 treesize of output 34 [2024-11-16 06:37:50,993 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-11-16 06:37:50,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2024-11-16 06:37:51,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-16 06:37:51,080 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 64 treesize of output 48 [2024-11-16 06:37:51,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:51,150 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 67 treesize of output 47 [2024-11-16 06:37:51,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-16 06:37:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:51,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:51,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_470 (Array Int Int)) (v_ArrVal_468 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_470) .cse0) .cse1) .cse0))) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_472 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_469) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_472) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2024-11-16 06:38:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419723633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:02,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 38 [2024-11-16 06:38:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244305549] [2024-11-16 06:38:02,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-16 06:38:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-16 06:38:02,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2098, Unknown=7, NotChecked=92, Total=2352 [2024-11-16 06:38:02,180 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 38 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 30 states have internal predecessors, (60), 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-11-16 06:38:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:03,313 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2024-11-16 06:38:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-16 06:38:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 30 states have internal predecessors, (60), 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 40 [2024-11-16 06:38:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:03,315 INFO L225 Difference]: With dead ends: 100 [2024-11-16 06:38:03,316 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 06:38:03,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=338, Invalid=4351, Unknown=7, NotChecked=134, Total=4830 [2024-11-16 06:38:03,318 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 100 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:03,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 458 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 06:38:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 06:38:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2024-11-16 06:38:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 06:38:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-11-16 06:38:03,335 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 40 [2024-11-16 06:38:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-11-16 06:38:03,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 30 states have internal predecessors, (60), 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-11-16 06:38:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-11-16 06:38:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 06:38:03,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:03,338 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2024-11-16 06:38:03,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 06:38:03,539 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-11-16 06:38:03,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1401681853, now seen corresponding path program 1 times [2024-11-16 06:38:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:03,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042018791] [2024-11-16 06:38:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:05,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042018791] [2024-11-16 06:38:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042018791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518067716] [2024-11-16 06:38:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:05,430 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-11-16 06:38:05,434 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-11-16 06:38:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:05,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-11-16 06:38:05,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:05,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:38:06,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-16 06:38:06,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:38:06,105 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:38:06,106 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-11-16 06:38:06,176 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-11-16 06:38:06,181 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-11-16 06:38:06,188 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 19 treesize of output 11 [2024-11-16 06:38:06,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 06:38:06,287 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 66 treesize of output 57 [2024-11-16 06:38:06,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-16 06:38:06,297 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 24 treesize of output 11 [2024-11-16 06:38:06,426 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-11-16 06:38:06,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-16 06:38:06,434 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-11-16 06:38:06,438 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-11-16 06:38:06,644 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:38:06,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-16 06:38:06,665 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-16 06:38:06,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-16 06:38:06,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:06,685 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-11-16 06:38:06,702 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:38:06,702 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-11-16 06:38:07,179 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-16 06:38:07,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 19 [2024-11-16 06:38:07,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-16 06:38:07,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-16 06:38:07,379 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 27 treesize of output 25 [2024-11-16 06:38:07,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-16 06:38:07,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 06:38:07,648 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-11-16 06:38:07,652 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-11-16 06:38:07,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-16 06:38:07,719 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 26 treesize of output 14 [2024-11-16 06:38:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:38:07,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38: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 12 treesize of output 8 [2024-11-16 06:38:10,062 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_659 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_659)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_658) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-16 06:38:10,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518067716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:10,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:10,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 47 [2024-11-16 06:38:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956835761] [2024-11-16 06:38:10,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:10,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-16 06:38:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:10,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-16 06:38:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3020, Unknown=3, NotChecked=110, Total=3306 [2024-11-16 06:38:10,705 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 47 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 39 states have internal predecessors, (70), 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-11-16 06:38:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:13,876 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2024-11-16 06:38:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-16 06:38:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 39 states have internal predecessors, (70), 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 44 [2024-11-16 06:38:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:13,879 INFO L225 Difference]: With dead ends: 121 [2024-11-16 06:38:13,879 INFO L226 Difference]: Without dead ends: 112 [2024-11-16 06:38:13,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=488, Invalid=7703, Unknown=3, NotChecked=178, Total=8372 [2024-11-16 06:38:13,882 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 127 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:13,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 841 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 06:38:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-16 06:38:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2024-11-16 06:38:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.178082191780822) internal successors, (86), 73 states have internal predecessors, (86), 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-11-16 06:38:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-16 06:38:13,893 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 44 [2024-11-16 06:38:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:13,893 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-16 06:38:13,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 39 states have internal predecessors, (70), 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-11-16 06:38:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-16 06:38:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 06:38:13,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:13,894 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2024-11-16 06:38:13,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 06:38:14,095 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-11-16 06:38:14,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:14,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1190966238, now seen corresponding path program 2 times [2024-11-16 06:38:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:14,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354305522] [2024-11-16 06:38:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 06:38:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354305522] [2024-11-16 06:38:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354305522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533454191] [2024-11-16 06:38:15,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:38:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:15,578 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-11-16 06:38:15,582 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-11-16 06:38:15,914 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:38:15,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:38:15,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-11-16 06:38:15,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:15,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:38:16,119 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) (= (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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-16 06:38:16,121 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) (= (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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-16 06:38:16,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:38:16,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:38:16,150 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |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)) is different from false [2024-11-16 06:38:16,152 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |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)) is different from true [2024-11-16 06:38:16,207 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 06:38:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2024-11-16 06:38:16,224 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-16 06:38:16,224 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 27 treesize of output 22 [2024-11-16 06:38:16,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)))) is different from false [2024-11-16 06:38:16,239 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)))) is different from true [2024-11-16 06:38:16,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 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| .cse0) 0) 0)))) is different from false [2024-11-16 06:38:16,274 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 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| .cse0) 0) 0)))) is different from true [2024-11-16 06:38:16,285 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-16 06:38:16,285 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-11-16 06:38:16,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:16,292 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-11-16 06:38:16,312 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-16 06:38:16,314 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-16 06:38:16,337 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-16 06:38:16,339 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-16 06:38:16,384 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) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-16 06:38:16,386 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) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-16 06:38:16,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:16,469 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-16 06:38:16,469 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-11-16 06:38:16,504 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-16 06:38:16,504 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-11-16 06:38:16,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse3)))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0))))))) is different from false [2024-11-16 06:38:16,578 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse3)))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0))))))) is different from true [2024-11-16 06:38:16,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse5 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-16 06:38:16,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse5 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-16 06:38:16,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (let ((.cse5 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-16 06:38:16,752 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (let ((.cse5 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-16 06:38:16,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (let ((.cse7 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse7) (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |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$#1.offset| .cse5) .cse6))))) is different from false [2024-11-16 06:38:16,890 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (let ((.cse7 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse7) (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |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$#1.offset| .cse5) .cse6))))) is different from true [2024-11-16 06:38:16,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |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_#t~mem12#1.offset|) (let ((.cse7 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse7) (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse5) (= .cse6 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from false [2024-11-16 06:38:16,999 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |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_#t~mem12#1.offset|) (let ((.cse7 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse7) (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse5) (= .cse6 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from true [2024-11-16 06:38:17,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:17,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:17,061 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2024-11-16 06:38:17,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 1 [2024-11-16 06:38:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 13 not checked. [2024-11-16 06:38:17,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:17,092 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 12 treesize of output 8 [2024-11-16 06:38:17,093 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 12 treesize of output 8 [2024-11-16 06:38:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533454191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:17,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:17,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 36 [2024-11-16 06:38:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773349286] [2024-11-16 06:38:17,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-16 06:38:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-16 06:38:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=913, Unknown=24, NotChecked=852, Total=1892 [2024-11-16 06:38:17,441 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 36 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 28 states have internal predecessors, (60), 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-11-16 06:38:17,613 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) (= (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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-16 06:38:17,614 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) (= (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) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-16 06:38:17,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (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))) is different from false [2024-11-16 06:38:17,618 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= (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))) is different from true [2024-11-16 06:38:17,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from false [2024-11-16 06:38:17,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)))) is different from true [2024-11-16 06:38:17,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= .cse3 .cse4)) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 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| .cse0) 0) 0) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from false [2024-11-16 06:38:17,633 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 0) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 0) 0) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= .cse3 .cse4)) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 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| .cse0) 0) 0) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from true [2024-11-16 06:38:17,636 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2024-11-16 06:38:17,638 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2024-11-16 06:38:17,641 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-16 06:38:17,642 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-16 06:38:17,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-16 06:38:17,653 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-16 06:38:17,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse12 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse7 .cse12)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse12)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) .cse3) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) .cse6) (not (= (select .cse7 .cse3) .cse6)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse9) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse9) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse10 (select |v_old(#valid)_AFTER_CALL_12| .cse10))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse11 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse9)))) (or (and (= .cse8 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse11) (and .cse11 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)))))))) is different from false [2024-11-16 06:38:17,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse12 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse7 .cse12)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse12)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) .cse3) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) .cse6) (not (= (select .cse7 .cse3) .cse6)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse9) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse9) 1) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse10 (select |v_old(#valid)_AFTER_CALL_12| .cse10))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse11 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse9)))) (or (and (= .cse8 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse11) (and .cse11 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)))))))) is different from true [2024-11-16 06:38:17,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse10 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse12 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse10 .cse12)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse12)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |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.base| .cse9) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) .cse3) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse9) 1))) (not (= (select .cse10 .cse3) .cse6)) (= .cse9 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse11 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse9) .cse11) (and .cse11 (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2024-11-16 06:38:17,680 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse10 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse12 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse10 .cse12)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse12)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |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.base| .cse9) 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) .cse3) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_old(#valid)_AFTER_CALL_12| .cse8))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse9) 1))) (not (= (select .cse10 .cse3) .cse6)) (= .cse9 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (let ((.cse11 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse9) .cse11) (and .cse11 (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2024-11-16 06:38:17,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse5) (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse8) 1))) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse9 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5) .cse1) (let ((.cse10 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8) .cse10) (and .cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-16 06:38:17,690 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse5) (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse8) 1))) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse9 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5) .cse1) (let ((.cse10 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8) .cse10) (and .cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-16 06:38:17,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse7) 1))) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse8 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|)) (let ((.cse9 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse5) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) .cse9) (and .cse9 (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-16 06:38:17,702 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse7) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse7) 1))) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse5) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse8 0) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|)) (let ((.cse9 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse5) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) .cse9) (and .cse9 (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-16 06:38:17,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse6 (select .cse5 0)) (.cse7 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (let ((.cse9 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse9) (and .cse9 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |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$#1.offset| .cse6) .cse7))))) is different from false [2024-11-16 06:38:17,713 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse6 (select .cse5 0)) (.cse7 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (let ((.cse9 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse9) (and .cse9 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |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$#1.offset| .cse6) .cse7))))) is different from true [2024-11-16 06:38:17,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |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_#t~mem12#1.offset|) (let ((.cse7 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse7) (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse5) (= .cse6 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from false [2024-11-16 06:38:17,727 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 0)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimIndex_4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_13| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0)))) (= |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|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1))) (= .cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |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_#t~mem12#1.offset|) (let ((.cse7 (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) .cse7) (and .cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| .cse5) (= .cse6 |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset|) (= (select (select |c_#memory_$Pointer$#1.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_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))))) is different from true [2024-11-16 06:38:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:17,830 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2024-11-16 06:38:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 06:38:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 28 states have internal predecessors, (60), 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 46 [2024-11-16 06:38:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:17,832 INFO L225 Difference]: With dead ends: 97 [2024-11-16 06:38:17,832 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 06:38:17,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=1032, Unknown=50, NotChecked=2200, Total=3422 [2024-11-16 06:38:17,833 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:17,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 1117 Unchecked, 0.2s Time] [2024-11-16 06:38:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 06:38:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-16 06:38:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 states have internal predecessors, (82), 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-11-16 06:38:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2024-11-16 06:38:17,843 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 46 [2024-11-16 06:38:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:17,843 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2024-11-16 06:38:17,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 28 states have internal predecessors, (60), 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-11-16 06:38:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2024-11-16 06:38:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 06:38:17,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:17,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:38:17,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 06:38:18,044 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-11-16 06:38:18,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:18,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1315719668, now seen corresponding path program 1 times [2024-11-16 06:38:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311353470] [2024-11-16 06:38:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:18,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-16 06:38:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311353470] [2024-11-16 06:38:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311353470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568993849] [2024-11-16 06:38:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:18,314 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-11-16 06:38:18,315 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-11-16 06:38:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:18,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-11-16 06:38:18,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:18,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:38:18,618 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:38:18,618 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-11-16 06:38:18,661 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-11-16 06:38:18,667 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-11-16 06:38:18,732 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 06:38:18,732 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 56 treesize of output 38 [2024-11-16 06:38:18,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-16 06:38:18,833 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-16 06:38:18,833 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 64 treesize of output 31 [2024-11-16 06:38:18,838 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-11-16 06:38:18,841 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-11-16 06:38:18,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:18,993 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-16 06:38:18,993 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 72 treesize of output 55 [2024-11-16 06:38:19,007 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:38:19,007 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-11-16 06:38:19,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-16 06:38:19,527 INFO L349 Elim1Store]: treesize reduction 118, result has 36.2 percent of original size [2024-11-16 06:38:19,527 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 125 treesize of output 122 [2024-11-16 06:38:19,561 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-16 06:38:19,561 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2024-11-16 06:38:19,580 INFO L349 Elim1Store]: treesize reduction 41, result has 24.1 percent of original size [2024-11-16 06:38:19,581 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 3 case distinctions, treesize of input 42 treesize of output 43 [2024-11-16 06:38:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:38:19,776 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-16 06:38:19,776 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 89 treesize of output 66 [2024-11-16 06:38:19,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33