./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:25:42,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:25:42,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:25:42,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:25:42,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:25:42,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:25:42,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:25:42,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:25:42,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:25:42,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:25:42,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:25:42,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:25:42,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:25:42,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:25:42,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:25:42,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:25:42,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:25:42,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:25:42,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:25:42,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:25:42,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:25:42,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:25:42,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:25:42,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:25:42,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:25:42,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:25:42,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:25:42,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:25:42,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:25:42,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:25:42,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:25:42,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:25:42,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:25:42,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:25:42,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:25:42,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:25:42,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:25:42,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:25:42,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:25:42,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:25:42,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:25:42,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:25:42,163 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2024-10-12 18:25:42,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:25:42,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:25:42,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:25:42,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:25:42,466 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:25:42,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-10-12 18:25:43,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:25:44,079 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:25:44,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-10-12 18:25:44,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1731c1df/b255a60b5ea34271a6fc4e25ec663513/FLAG8c6e1e1b8 [2024-10-12 18:25:44,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1731c1df/b255a60b5ea34271a6fc4e25ec663513 [2024-10-12 18:25:44,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:25:44,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:25:44,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:25:44,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:25:44,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:25:44,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555bbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44, skipping insertion in model container [2024-10-12 18:25:44,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:25:44,488 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-10-12 18:25:44,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:25:44,502 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:25:44,537 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-10-12 18:25:44,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:25:44,586 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:25:44,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44 WrapperNode [2024-10-12 18:25:44,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:25:44,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:25:44,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:25:44,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:25:44,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,664 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2024-10-12 18:25:44,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:25:44,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:25:44,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:25:44,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:25:44,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,717 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2024-10-12 18:25:44,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:25:44,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:25:44,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:25:44,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:25:44,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:25:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:44,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:25:44,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:25:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:25:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:25:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:25:44,852 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:25:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:25:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:25:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:25:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:25:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:25:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:25:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:25:44,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:25:44,981 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:25:44,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:25:45,176 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-12 18:25:45,177 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:25:45,209 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:25:45,210 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:25:45,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:25:45 BoogieIcfgContainer [2024-10-12 18:25:45,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:25:45,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:25:45,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:25:45,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:25:45,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:25:44" (1/3) ... [2024-10-12 18:25:45,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f621fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:25:45, skipping insertion in model container [2024-10-12 18:25:45,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (2/3) ... [2024-10-12 18:25:45,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f621fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:25:45, skipping insertion in model container [2024-10-12 18:25:45,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:25:45" (3/3) ... [2024-10-12 18:25:45,219 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2024-10-12 18:25:45,235 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:25:45,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:25:45,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:25:45,294 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;@74964e28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:25:45,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:25:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:25:45,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:45,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:45,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:45,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:45,315 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2024-10-12 18:25:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756459978] [2024-10-12 18:25:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:25:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:45,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756459978] [2024-10-12 18:25:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756459978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:45,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:45,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:25:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850316333] [2024-10-12 18:25:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:45,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:25:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:25:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:25:45,644 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:45,703 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2024-10-12 18:25:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:25:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-12 18:25:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:45,713 INFO L225 Difference]: With dead ends: 54 [2024-10-12 18:25:45,714 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 18:25:45,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:25:45,720 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:45,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:25:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 18:25:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 18:25:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-12 18:25:45,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2024-10-12 18:25:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:45,753 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-12 18:25:45,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-12 18:25:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:25:45,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:45,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:45,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:25:45,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:45,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2024-10-12 18:25:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894066258] [2024-10-12 18:25:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:25:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894066258] [2024-10-12 18:25:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894066258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:25:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882527231] [2024-10-12 18:25:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:45,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:25:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:45,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:25:45,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:45,961 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:46,008 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-10-12 18:25:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:25:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-12 18:25:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:46,010 INFO L225 Difference]: With dead ends: 43 [2024-10-12 18:25:46,011 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 18:25:46,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:46,013 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:46,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:25:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 18:25:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-12 18:25:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-12 18:25:46,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2024-10-12 18:25:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:46,022 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 18:25:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-12 18:25:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:25:46,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:46,023 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:25:46,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2024-10-12 18:25:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680133788] [2024-10-12 18:25:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680133788] [2024-10-12 18:25:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680133788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316686874] [2024-10-12 18:25:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:46,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:46,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:46,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:25:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-12 18:25:46,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-12 18:25:46,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 18:25:46,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2024-10-12 18:25:46,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 18:25:46,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-12 18:25:46,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 18:25:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 18:25:46,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:25:46,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316686874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:46,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:25:46,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2024-10-12 18:25:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063054983] [2024-10-12 18:25:46,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:46,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:25:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:25:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-12 18:25:46,966 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:25:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:47,172 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-12 18:25:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:25:47,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-12 18:25:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:47,174 INFO L225 Difference]: With dead ends: 37 [2024-10-12 18:25:47,174 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:25:47,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-12 18:25:47,175 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:47,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:25:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:25:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2024-10-12 18:25:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-12 18:25:47,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2024-10-12 18:25:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:47,183 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-12 18:25:47,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:25:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-12 18:25:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:25:47,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:47,184 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:47,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:25:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:47,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:47,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -730705930, now seen corresponding path program 1 times [2024-10-12 18:25:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487793550] [2024-10-12 18:25:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:47,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487793550] [2024-10-12 18:25:47,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487793550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:47,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613014217] [2024-10-12 18:25:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:47,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:47,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:47,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:25:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:47,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:25:47,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:47,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-12 18:25:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:25:47,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613014217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:25:47,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:25:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2024-10-12 18:25:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111582597] [2024-10-12 18:25:47,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:25:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:25:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:25:47,985 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:25:52,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:25:56,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:00,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:04,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:08,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:12,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:12,237 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-12 18:26:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 18:26:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2024-10-12 18:26:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:12,240 INFO L225 Difference]: With dead ends: 38 [2024-10-12 18:26:12,240 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 18:26:12,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-12 18:26:12,241 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:12,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 175 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-10-12 18:26:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 18:26:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-12 18:26:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:26:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-12 18:26:12,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2024-10-12 18:26:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:12,256 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 18:26:12,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:26:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-12 18:26:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:26:12,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:12,257 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:12,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:26:12,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 18:26:12,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:12,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2024-10-12 18:26:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453690502] [2024-10-12 18:26:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:13,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453690502] [2024-10-12 18:26:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453690502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131501030] [2024-10-12 18:26:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:13,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:13,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:26:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:13,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-12 18:26:13,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:13,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:13,825 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:13,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:26:13,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:13,910 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-12 18:26:13,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2024-10-12 18:26:13,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-12 18:26:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:26:13,987 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_28| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_28| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_28|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_28|) 0))) is different from true [2024-10-12 18:26:13,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:13,996 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-10-12 18:26:14,009 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-12 18:26:14,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-12 18:26:14,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-12 18:26:14,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-12 18:26:14,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-12 18:26:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:26:14,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131501030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:14,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2024-10-12 18:26:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007551557] [2024-10-12 18:26:14,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 18:26:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 18:26:14,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=734, Unknown=1, NotChecked=54, Total=870 [2024-10-12 18:26:14,248 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 18:26:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:14,922 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-10-12 18:26:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 18:26:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 27 [2024-10-12 18:26:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:14,924 INFO L225 Difference]: With dead ends: 61 [2024-10-12 18:26:14,925 INFO L226 Difference]: Without dead ends: 53 [2024-10-12 18:26:14,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1180, Unknown=1, NotChecked=70, Total=1406 [2024-10-12 18:26:14,927 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:14,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 229 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 362 Invalid, 0 Unknown, 63 Unchecked, 0.4s Time] [2024-10-12 18:26:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-12 18:26:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2024-10-12 18:26:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-12 18:26:14,944 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 27 [2024-10-12 18:26:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-12 18:26:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 18:26:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-10-12 18:26:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:26:14,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:14,947 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:14,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:26:15,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:15,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:15,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2024-10-12 18:26:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059881876] [2024-10-12 18:26:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059881876] [2024-10-12 18:26:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059881876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495603196] [2024-10-12 18:26:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:16,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:16,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:16,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:26:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-12 18:26:16,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:17,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:17,192 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:17,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:26:17,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:17,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:26:17,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-10-12 18:26:17,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:26:17,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:17,575 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-10-12 18:26:17,704 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:26:17,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-12 18:26:17,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:26:18,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:18,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:18,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-10-12 18:26:18,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:18,215 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 15 treesize of output 15 [2024-10-12 18:26:18,431 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-10-12 18:26:18,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2024-10-12 18:26:18,447 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-12 18:26:18,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 18:26:18,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-10-12 18:26:18,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:26:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 18:26:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:26:18,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:20,515 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 Int) (v_ArrVal_829 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_827)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_829) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-12 18:26:21,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:21,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2024-10-12 18:26:21,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:21,134 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 94 treesize of output 95 [2024-10-12 18:26:21,141 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 35 treesize of output 19 [2024-10-12 18:26:21,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:21,155 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 1 case distinctions, treesize of input 19 treesize of output 8 [2024-10-12 18:26:21,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:21,169 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 36 treesize of output 39 [2024-10-12 18:26:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495603196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:21,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:21,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2024-10-12 18:26:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439304239] [2024-10-12 18:26:21,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:21,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-12 18:26:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:21,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-12 18:26:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2482, Unknown=3, NotChecked=100, Total=2756 [2024-10-12 18:26:21,438 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 44 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:23,200 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-10-12 18:26:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 18:26:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-10-12 18:26:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:23,202 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:26:23,202 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 18:26:23,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=351, Invalid=4206, Unknown=3, NotChecked=132, Total=4692 [2024-10-12 18:26:23,205 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 54 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:23,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 240 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:26:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 18:26:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2024-10-12 18:26:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-12 18:26:23,217 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 29 [2024-10-12 18:26:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:23,217 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-12 18:26:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-12 18:26:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:26:23,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:23,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:23,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:26:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:23,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:23,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2024-10-12 18:26:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512812537] [2024-10-12 18:26:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:24,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512812537] [2024-10-12 18:26:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512812537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740611397] [2024-10-12 18:26:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:24,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:24,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:24,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:24,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:26:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:24,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-12 18:26:24,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:24,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:25,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-12 18:26:25,298 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-10-12 18:26:25,361 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-12 18:26:25,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-12 18:26:25,593 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-10-12 18:26:25,831 INFO L349 Elim1Store]: treesize reduction 43, result has 40.3 percent of original size [2024-10-12 18:26:25,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 39 [2024-10-12 18:26:25,863 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-10-12 18:26:25,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 55 [2024-10-12 18:26:25,885 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-12 18:26:25,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 18:26:25,951 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-10-12 18:26:26,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-10-12 18:26:26,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-12 18:26:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:26:26,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:26,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2024-10-12 18:26:26,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:26,660 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 717 treesize of output 720 [2024-10-12 18:26:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740611397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:27,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:27,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2024-10-12 18:26:27,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863126429] [2024-10-12 18:26:27,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:27,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-12 18:26:27,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-12 18:26:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1861, Unknown=0, NotChecked=0, Total=1980 [2024-10-12 18:26:27,234 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 18:26:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:28,680 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-10-12 18:26:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-12 18:26:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-10-12 18:26:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:28,682 INFO L225 Difference]: With dead ends: 64 [2024-10-12 18:26:28,682 INFO L226 Difference]: Without dead ends: 61 [2024-10-12 18:26:28,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=279, Invalid=3753, Unknown=0, NotChecked=0, Total=4032 [2024-10-12 18:26:28,683 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:28,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 300 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 18:26:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-12 18:26:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2024-10-12 18:26:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-10-12 18:26:28,691 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 31 [2024-10-12 18:26:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:28,692 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-10-12 18:26:28,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 18:26:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-10-12 18:26:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:26:28,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:28,693 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:28,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:26:28,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:28,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2024-10-12 18:26:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147822063] [2024-10-12 18:26:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:29,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:30,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:30,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147822063] [2024-10-12 18:26:30,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147822063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:30,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899984411] [2024-10-12 18:26:30,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:26:30,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:30,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:30,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:30,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:26:30,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:26:30,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:26:30,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-10-12 18:26:30,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:30,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:30,428 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-10-12 18:26:30,430 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-10-12 18:26:30,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:30,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:30,454 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-10-12 18:26:30,456 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from true [2024-10-12 18:26:30,487 INFO L349 Elim1Store]: treesize reduction 77, result has 16.3 percent of original size [2024-10-12 18:26:30,487 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 101 treesize of output 55 [2024-10-12 18:26:30,529 INFO L349 Elim1Store]: treesize reduction 45, result has 39.2 percent of original size [2024-10-12 18:26:30,529 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 68 treesize of output 59 [2024-10-12 18:26:30,538 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 29 treesize of output 23 [2024-10-12 18:26:30,555 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|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_17| .cse0)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse3 v_arrayElimCell_61) .cse0)) (= .cse2 .cse0)) (= (select .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse4)) .cse0)))))) is different from false [2024-10-12 18:26:30,558 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_17| .cse0)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse3 v_arrayElimCell_61) .cse0)) (= .cse2 .cse0)) (= (select .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse4)) .cse0)))))) is different from true [2024-10-12 18:26:30,584 INFO L349 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2024-10-12 18:26:30,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 52 [2024-10-12 18:26:30,591 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 20 treesize of output 8 [2024-10-12 18:26:30,616 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_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-10-12 18:26:30,618 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_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-10-12 18:26:30,645 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |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-10-12 18:26:30,647 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |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-10-12 18:26:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:30,675 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 4)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |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-10-12 18:26:30,677 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 4)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |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-10-12 18:26:30,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:30,720 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:26:30,720 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 105 treesize of output 80 [2024-10-12 18:26:30,734 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:26:30,735 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 88 treesize of output 91 [2024-10-12 18:26:30,751 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 29 treesize of output 23 [2024-10-12 18:26:30,797 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|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse4 v_arrayElimCell_61) .cse0)) (= .cse1 .cse0)))) (or .cse3 (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse4 v_arrayElimCell_69) .cse0)) .cse3)) (= (select .cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse5)) .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))))))))) is different from false [2024-10-12 18:26:30,800 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse5))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse4 v_arrayElimCell_61) .cse0)) (= .cse1 .cse0)))) (or .cse3 (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse4 v_arrayElimCell_69) .cse0)) .cse3)) (= (select .cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse5)) .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7)))))))))) is different from true [2024-10-12 18:26:30,874 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|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse7))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse5 v_arrayElimCell_61) .cse0)) (= .cse1 .cse0)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse5 v_arrayElimCell_69) .cse0)) .cse6) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) .cse6 (= (select .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse7)) .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-10-12 18:26:30,877 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse7))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse5 v_arrayElimCell_61) .cse0)) (= .cse1 .cse0)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse5 v_arrayElimCell_69) .cse0)) .cse6) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) .cse6 (= (select .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse7)) .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-10-12 18:26:30,962 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|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse7))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse5 v_arrayElimCell_61) .cse0)) (= .cse1 .cse0)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse5 v_arrayElimCell_69) .cse0)) .cse6) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) .cse6 (= (select .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse7)) .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-10-12 18:26:30,965 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse7))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))))))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse5 v_arrayElimCell_61) .cse0)) (= .cse1 .cse0)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse5 v_arrayElimCell_69) .cse0)) .cse6) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) .cse6 (= (select .cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse7)) .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-10-12 18:26:31,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:31,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:31,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 146 [2024-10-12 18:26:31,148 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|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (let ((.cse6 (= .cse1 .cse0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (and (exists ((v_prenex_11 Int)) (= (select .cse5 v_prenex_11) .cse0)) .cse6) (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse5 v_arrayElimCell_69) .cse0)) (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse5 v_arrayElimCell_61) .cse0)) .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from false [2024-10-12 18:26:31,152 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_18| .cse2)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (let ((.cse6 (= .cse1 .cse0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (and (exists ((v_prenex_11 Int)) (= (select .cse5 v_prenex_11) .cse0)) .cse6) (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse5 v_arrayElimCell_69) .cse0)) (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse5 v_arrayElimCell_61) .cse0)) .cse6)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1)))) is different from true [2024-10-12 18:26:31,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:26:31,335 INFO L349 Elim1Store]: treesize reduction 254, result has 17.8 percent of original size [2024-10-12 18:26:31,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 179 treesize of output 123 [2024-10-12 18:26:31,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))) is different from false [2024-10-12 18:26:31,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))) is different from true [2024-10-12 18:26:31,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:31,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-10-12 18:26:31,563 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-10-12 18:26:31,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 56 [2024-10-12 18:26:31,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:31,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:26:34,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse6 (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_79 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_79) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_79) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse11 (select |v_old(#valid)_AFTER_CALL_18| .cse11)))))))) (or (exists ((v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3))))))))))) (and (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5)))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse6) (and (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))))) .cse6) (exists ((v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_13| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9)))) (exists ((v_arrayElimCell_80 Int)) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_80) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_80) 1) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse10 (select |v_old(#valid)_AFTER_CALL_18| .cse10)))))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_80) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_80) 1))))))))) (= (select (select |c_#memory_int#1| .cse2) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2024-10-12 18:26:34,249 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse6 (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_79 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_79) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_79) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse11 (select |v_old(#valid)_AFTER_CALL_18| .cse11)))))))) (or (exists ((v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_13| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0)))) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_18| .cse3))))))))))) (and (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5)))) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse6) (and (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))))) .cse6) (exists ((v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_13| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9)))) (exists ((v_arrayElimCell_80 Int)) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_80) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_80) 1) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse10 (select |v_old(#valid)_AFTER_CALL_18| .cse10)))))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_80) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_80) 1))))))))) (= (select (select |c_#memory_int#1| .cse2) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2024-10-12 18:26:34,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:34,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 316 treesize of output 332 [2024-10-12 18:26:34,475 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-10-12 18:26:36,824 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (or (exists ((v_prenex_61 (Array Int Int)) (v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_62 (Array Int Int))) (and (= (select v_prenex_61 v_prenex_59) 1) (= v_prenex_61 (let ((.cse0 (@diff v_prenex_62 v_prenex_61))) (store v_prenex_62 .cse0 (select v_prenex_61 .cse0)))) (= (select v_prenex_62 v_prenex_59) 0) (= (select v_prenex_61 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_62 v_prenex_55) 1))) (exists ((v_arrayElimCell_80 Int) (v_prenex_69 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_prenex_65 Int) (v_prenex_67 (Array Int Int)) (v_prenex_64 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_68 v_arrayElimCell_80) 1) (= (select v_prenex_69 v_prenex_64) 1) (= (select v_prenex_68 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_67 v_prenex_65) 1) (= (select v_prenex_69 v_arrayElimCell_80) 0) (= (select v_prenex_67 v_arrayElimCell_80) 0) (= v_prenex_68 (let ((.cse1 (@diff v_prenex_69 v_prenex_68))) (store v_prenex_69 .cse1 (select v_prenex_68 .cse1)))) (= (let ((.cse2 (@diff v_prenex_67 v_prenex_66))) (store v_prenex_67 .cse2 (select v_prenex_66 .cse2))) v_prenex_66) (= (select v_prenex_66 v_arrayElimCell_80) 1))) (exists ((v_arrayElimCell_84 Int)) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_84) 0))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_84) 1) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_84) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_18| .cse4)))))))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_47 Int) (v_arrayElimCell_79 Int)) (and (= (select v_prenex_52 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select v_prenex_52 v_arrayElimCell_79)) (= (select v_prenex_53 v_arrayElimCell_79) 0) (= (select v_prenex_53 v_prenex_47) 1) (= v_prenex_52 (let ((.cse5 (@diff v_prenex_53 v_prenex_52))) (store v_prenex_53 .cse5 (select v_prenex_52 .cse5))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-10-12 18:26:36,835 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (or (exists ((v_prenex_61 (Array Int Int)) (v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_62 (Array Int Int))) (and (= (select v_prenex_61 v_prenex_59) 1) (= v_prenex_61 (let ((.cse0 (@diff v_prenex_62 v_prenex_61))) (store v_prenex_62 .cse0 (select v_prenex_61 .cse0)))) (= (select v_prenex_62 v_prenex_59) 0) (= (select v_prenex_61 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_62 v_prenex_55) 1))) (exists ((v_arrayElimCell_80 Int) (v_prenex_69 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_prenex_65 Int) (v_prenex_67 (Array Int Int)) (v_prenex_64 Int) (v_prenex_66 (Array Int Int))) (and (= (select v_prenex_68 v_arrayElimCell_80) 1) (= (select v_prenex_69 v_prenex_64) 1) (= (select v_prenex_68 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_67 v_prenex_65) 1) (= (select v_prenex_69 v_arrayElimCell_80) 0) (= (select v_prenex_67 v_arrayElimCell_80) 0) (= v_prenex_68 (let ((.cse1 (@diff v_prenex_69 v_prenex_68))) (store v_prenex_69 .cse1 (select v_prenex_68 .cse1)))) (= (let ((.cse2 (@diff v_prenex_67 v_prenex_66))) (store v_prenex_67 .cse2 (select v_prenex_66 .cse2))) v_prenex_66) (= (select v_prenex_66 v_arrayElimCell_80) 1))) (exists ((v_arrayElimCell_84 Int)) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_84) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimCell_84) 0))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimCell_84) 1) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_84) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_6) 1) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_18| .cse4)))))))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_47 Int) (v_arrayElimCell_79 Int)) (and (= (select v_prenex_52 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 1 (select v_prenex_52 v_arrayElimCell_79)) (= (select v_prenex_53 v_arrayElimCell_79) 0) (= (select v_prenex_53 v_prenex_47) 1) (= v_prenex_52 (let ((.cse5 (@diff v_prenex_53 v_prenex_52))) (store v_prenex_53 .cse5 (select v_prenex_52 .cse5))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-10-12 18:26:39,148 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-10-12 18:26:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2024-10-12 18:26:39,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:39,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_1205)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_1206) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-12 18:26:39,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_1205)) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_1206) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-12 18:26:39,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_1205)) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))) v_ArrVal_1206) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-10-12 18:26:42,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:42,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 90 [2024-10-12 18:26:42,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:42,304 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 168 treesize of output 169 [2024-10-12 18:26:42,312 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 72 treesize of output 56 [2024-10-12 18:26:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899984411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:42,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:42,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 36 [2024-10-12 18:26:42,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384344715] [2024-10-12 18:26:42,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:42,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-12 18:26:42,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-12 18:26:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=735, Unknown=41, NotChecked=1104, Total=1980 [2024-10-12 18:26:42,496 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 28 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:42,623 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 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|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-10-12 18:26:42,625 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 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|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-10-12 18:26:42,628 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-10-12 18:26:42,629 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from true [2024-10-12 18:26:42,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse3 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse9 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse9)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse9)) (.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse9))) (and (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= .cse3 .cse4) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5) .cse6) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse5) .cse4) (= .cse7 .cse8) (= .cse6 .cse9) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse10 (select |c_#valid| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_17| .cse11) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_17| .cse4)))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse11))) (or (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse12 v_arrayElimCell_61) .cse4)) (= .cse11 .cse4)) (= (select .cse12 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse9)) .cse4))) (= (select |c_#valid| .cse3) 1))))) is different from false [2024-10-12 18:26:42,637 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse3 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse9 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse9)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse9)) (.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse9))) (and (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= .cse3 .cse4) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5) .cse6) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse5) .cse4) (= .cse7 .cse8) (= .cse6 .cse9) (exists ((|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_17| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_17| .cse10 (select |c_#valid| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_17| .cse11) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_17| .cse4)))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse11))) (or (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse12 v_arrayElimCell_61) .cse4)) (= .cse11 .cse4)) (= (select .cse12 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse9)) .cse4))) (= (select |c_#valid| .cse3) 1))))) is different from true [2024-10-12 18:26:42,646 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_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2024-10-12 18:26:42,648 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_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2024-10-12 18:26:42,653 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |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-10-12 18:26:42,658 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))))))) (= |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-10-12 18:26:42,667 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_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 4)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))))))) (= |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-10-12 18:26:42,672 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_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 4)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))))))) (= |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-10-12 18:26:42,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse8)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse8)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse8)) (.cse13 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= .cse0 .cse1) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5)))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse6 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse7 v_arrayElimCell_61) .cse3)) (= .cse4 .cse3)))) (or .cse6 (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3) (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse7 v_arrayElimCell_69) .cse3)) .cse6)) (= (select .cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse8)) .cse3)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12) .cse13) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12) .cse3) (= .cse14 .cse15) (= .cse13 .cse8))))) is different from false [2024-10-12 18:26:42,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse8)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse8)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse8)) (.cse13 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= .cse0 .cse1) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5)))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse6 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse7 v_arrayElimCell_61) .cse3)) (= .cse4 .cse3)))) (or .cse6 (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3) (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse7 v_arrayElimCell_69) .cse3)) .cse6)) (= (select .cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse8)) .cse3)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12) .cse13) (= (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12) .cse3) (= .cse14 .cse15) (= .cse13 .cse8))))) is different from true [2024-10-12 18:26:42,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse15 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse15)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse15)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse15)) (.cse10 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9) .cse10) (= (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9) .cse3) (= .cse11 .cse12) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse14 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse13 v_arrayElimCell_61) .cse3)) (= .cse4 .cse3)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse13 v_arrayElimCell_69) .cse3)) .cse14) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) .cse14 (= (select .cse13 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse15)) .cse3)))) (= .cse10 .cse15) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from false [2024-10-12 18:26:42,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse15 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse15)) (.cse9 (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse15)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse15)) (.cse10 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9) .cse10) (= (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9) .cse3) (= .cse11 .cse12) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse14 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse13 v_arrayElimCell_61) .cse3)) (= .cse4 .cse3)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse13 v_arrayElimCell_69) .cse3)) .cse14) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) .cse14 (= (select .cse13 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse15)) .cse3)))) (= .cse10 .cse15) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from true [2024-10-12 18:26:42,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse6 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse15)) (.cse3 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (= .cse2 .cse6) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse8 (select |v_old(#valid)_AFTER_CALL_18| .cse8)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) .cse6) (= .cse11 .cse12) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse14 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse13 v_arrayElimCell_61) .cse6)) (= .cse7 .cse6)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse13 v_arrayElimCell_69) .cse6)) .cse14) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6)) .cse14 (= (select .cse13 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse15)) .cse6)))) (= .cse3 .cse15) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from false [2024-10-12 18:26:42,720 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse6 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse15)) (.cse3 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (= .cse2 .cse6) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse8 (select |v_old(#valid)_AFTER_CALL_18| .cse8)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) .cse6) (= .cse11 .cse12) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse14 (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse13 v_arrayElimCell_61) .cse6)) (= .cse7 .cse6)))) (or (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse13 v_arrayElimCell_69) .cse6)) .cse14) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6)) .cse14 (= (select .cse13 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse15)) .cse6)))) (= .cse3 .cse15) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from true [2024-10-12 18:26:42,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse11))) (and (= .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse3) (= .cse4 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_18| .cse6)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse3) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse9 .cse10) (= .cse3 .cse11) (let ((.cse13 (= .cse5 .cse0)) (.cse12 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (and (exists ((v_prenex_11 Int)) (= (select .cse12 v_prenex_11) .cse0)) .cse13) (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse12 v_arrayElimCell_69) .cse0)) (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse12 v_arrayElimCell_61) .cse0)) .cse13)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from false [2024-10-12 18:26:42,738 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse11))) (and (= .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse3) (= .cse4 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_18| .cse6)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse3) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse9 .cse10) (= .cse3 .cse11) (let ((.cse13 (= .cse5 .cse0)) (.cse12 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (and (exists ((v_prenex_11 Int)) (= (select .cse12 v_prenex_11) .cse0)) .cse13) (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse12 v_arrayElimCell_69) .cse0)) (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse12 v_arrayElimCell_61) .cse0)) .cse13)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from true [2024-10-12 18:26:42,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse11))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse8) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse9 .cse10) (= .cse8 .cse11) (let ((.cse13 (= .cse4 .cse3)) (.cse12 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (and (exists ((v_prenex_11 Int)) (= (select .cse12 v_prenex_11) .cse3)) .cse13) (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse12 v_arrayElimCell_69) .cse3)) (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse12 v_arrayElimCell_61) .cse3)) .cse13)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (= (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse3))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from false [2024-10-12 18:26:42,753 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse11))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_18| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_18|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_18| .cse5)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_7|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| v_arrayElimIndex_3) 1) (= |v_#valid_BEFORE_CALL_13| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_17| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_17| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))))))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse8) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= .cse9 .cse10) (= .cse8 .cse11) (let ((.cse13 (= .cse4 .cse3)) (.cse12 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (and (exists ((v_prenex_11 Int)) (= (select .cse12 v_prenex_11) .cse3)) .cse13) (and (or (exists ((v_arrayElimCell_69 Int)) (= (select .cse12 v_arrayElimCell_69) .cse3)) (and (exists ((v_arrayElimCell_61 Int)) (= (select .cse12 v_arrayElimCell_61) .cse3)) .cse13)) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3)) (= (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse3))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1))))) is different from true [2024-10-12 18:26:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:42,841 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-10-12 18:26:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 18:26:42,844 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 28 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2024-10-12 18:26:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:42,844 INFO L225 Difference]: With dead ends: 74 [2024-10-12 18:26:42,844 INFO L226 Difference]: Without dead ends: 61 [2024-10-12 18:26:42,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=133, Invalid=842, Unknown=63, NotChecked=2268, Total=3306 [2024-10-12 18:26:42,846 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:42,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 864 Unchecked, 0.1s Time] [2024-10-12 18:26:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-12 18:26:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-12 18:26:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 18:26:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-10-12 18:26:42,864 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 31 [2024-10-12 18:26:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:42,864 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-10-12 18:26:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 28 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:26:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-10-12 18:26:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:26:42,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:42,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:42,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:26:43,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:43,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:43,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:43,068 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2024-10-12 18:26:43,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:43,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355088602] [2024-10-12 18:26:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:44,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355088602] [2024-10-12 18:26:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355088602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:44,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428339410] [2024-10-12 18:26:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:44,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:44,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:44,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:44,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 18:26:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:45,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-12 18:26:45,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:45,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:45,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:45,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:26:45,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:26:45,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:26:45,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-12 18:26:45,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:26:45,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-12 18:26:45,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:26:45,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-12 18:26:45,635 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:26:45,635 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-10-12 18:26:45,649 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:26:45,650 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-10-12 18:26:46,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 266 [2024-10-12 18:26:46,258 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-10-12 18:26:46,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 266 treesize of output 166 [2024-10-12 18:26:46,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:46,275 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2024-10-12 18:26:46,275 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 1 case distinctions, treesize of input 53 treesize of output 51 [2024-10-12 18:26:46,298 INFO L349 Elim1Store]: treesize reduction 95, result has 24.6 percent of original size [2024-10-12 18:26:46,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 86 [2024-10-12 18:26:46,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 244 [2024-10-12 18:26:46,379 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-10-12 18:26:46,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 244 treesize of output 152 [2024-10-12 18:26:46,407 INFO L349 Elim1Store]: treesize reduction 86, result has 28.9 percent of original size [2024-10-12 18:26:46,407 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 2 case distinctions, treesize of input 104 treesize of output 74 [2024-10-12 18:26:46,427 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-12 18:26:46,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2024-10-12 18:26:46,540 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-10-12 18:26:46,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 18:26:53,920 INFO L349 Elim1Store]: treesize reduction 168, result has 92.3 percent of original size [2024-10-12 18:26:53,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 33 new quantified variables, introduced 210 case distinctions, treesize of input 599 treesize of output 2331 [2024-10-12 18:26:54,159 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 394 treesize of output 322 [2024-10-12 18:26:54,619 INFO L224 Elim1Store]: Index analysis took 162 ms [2024-10-12 18:26:57,680 INFO L349 Elim1Store]: treesize reduction 120, result has 92.4 percent of original size [2024-10-12 18:26:57,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 255 treesize of output 1635