./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:10:27,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:10:27,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:10:27,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:10:27,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:10:27,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:10:27,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:10:27,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:10:27,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:10:27,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:10:27,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:10:27,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:10:27,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:10:27,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:10:27,562 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:10:27,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:10:27,562 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:10:27,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:10:27,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:10:27,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:10:27,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:10:27,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:10:27,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:10:27,564 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2025-03-08 23:10:27,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:10:27,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:10:27,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:10:27,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:10:27,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:10:27,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-03-08 23:10:28,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0915265/d955983b103b4172bf7db43c81d5bcfb/FLAGe2c312f0e [2025-03-08 23:10:29,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:10:29,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-03-08 23:10:29,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0915265/d955983b103b4172bf7db43c81d5bcfb/FLAGe2c312f0e [2025-03-08 23:10:29,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0915265/d955983b103b4172bf7db43c81d5bcfb [2025-03-08 23:10:29,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:10:29,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:10:29,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:10:29,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:10:29,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:10:29,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556ffe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29, skipping insertion in model container [2025-03-08 23:10:29,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:10:29,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:10:29,646 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:10:29,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:10:29,698 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:10:29,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29 WrapperNode [2025-03-08 23:10:29,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:10:29,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:10:29,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:10:29,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:10:29,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,729 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2025-03-08 23:10:29,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:10:29,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:10:29,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:10:29,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:10:29,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,756 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 15, 10]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2025-03-08 23:10:29,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:10:29,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:10:29,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:10:29,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:10:29,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (1/1) ... [2025-03-08 23:10:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:10:29,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:29,791 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) [2025-03-08 23:10:29,793 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 [2025-03-08 23:10:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:10:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:10:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 23:10:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:10:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:10:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:10:29,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:10:29,903 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:10:30,151 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 23:10:30,173 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 23:10:30,192 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-08 23:10:30,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:10:30,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:10:30,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:10:30,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:30 BoogieIcfgContainer [2025-03-08 23:10:30,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:10:30,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:10:30,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:10:30,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:10:30,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:10:29" (1/3) ... [2025-03-08 23:10:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124554f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:10:30, skipping insertion in model container [2025-03-08 23:10:30,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:29" (2/3) ... [2025-03-08 23:10:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124554f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:10:30, skipping insertion in model container [2025-03-08 23:10:30,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:30" (3/3) ... [2025-03-08 23:10:30,211 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2025-03-08 23:10:30,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:10:30,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_unequal.i that has 2 procedures, 131 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-03-08 23:10:30,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:10:30,264 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=None, 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;@7b08a6f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:10:30,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-08 23:10:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 126 states have internal predecessors, (139), 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) [2025-03-08 23:10:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:10:30,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:30,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:10:30,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash 585988116, now seen corresponding path program 1 times [2025-03-08 23:10:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-03-08 23:10:30,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:30,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:10:30,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:10:30,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-03-08 23:10:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011556709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:30,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:10:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204727] [2025-03-08 23:10:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:30,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:10:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:30,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:10:30,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:10:30,493 INFO L87 Difference]: Start difference. First operand has 131 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 126 states have internal predecessors, (139), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:30,600 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2025-03-08 23:10:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:10:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 23:10:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:30,606 INFO L225 Difference]: With dead ends: 128 [2025-03-08 23:10:30,606 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 23:10:30,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:10:30,609 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:30,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 23:10:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-08 23:10:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 120 states have internal predecessors, (128), 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) [2025-03-08 23:10:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2025-03-08 23:10:30,633 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2025-03-08 23:10:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:30,634 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2025-03-08 23:10:30,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2025-03-08 23:10:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:10:30,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:30,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:10:30,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:10:30,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash 585988117, now seen corresponding path program 1 times [2025-03-08 23:10:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430810940] [2025-03-08 23:10:30,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:30,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:10:30,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:10:30,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:30,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:30,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430810940] [2025-03-08 23:10:30,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430810940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:30,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:30,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:10:30,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479920476] [2025-03-08 23:10:30,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:10:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:30,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:10:30,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:10:30,747 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:30,810 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2025-03-08 23:10:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:10:30,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 23:10:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:30,811 INFO L225 Difference]: With dead ends: 123 [2025-03-08 23:10:30,811 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 23:10:30,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:10:30,811 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:30,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 23:10:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-08 23:10:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 118 states have internal predecessors, (126), 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) [2025-03-08 23:10:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2025-03-08 23:10:30,817 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 6 [2025-03-08 23:10:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:30,817 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2025-03-08 23:10:30,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:10:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2025-03-08 23:10:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:10:30,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:30,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:10:30,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -510504318, now seen corresponding path program 1 times [2025-03-08 23:10:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-08 23:10:30,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:30,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:10:30,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:10:30,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-08 23:10:30,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632598530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:30,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:10:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574890472] [2025-03-08 23:10:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:30,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:10:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:30,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:10:30,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:10:30,890 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:10:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:30,904 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-03-08 23:10:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:10:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-08 23:10:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:30,906 INFO L225 Difference]: With dead ends: 130 [2025-03-08 23:10:30,906 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 23:10:30,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:10:30,907 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:30,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 255 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:10:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 23:10:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2025-03-08 23:10:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 119 states have internal predecessors, (127), 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) [2025-03-08 23:10:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2025-03-08 23:10:30,917 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 13 [2025-03-08 23:10:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:30,918 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2025-03-08 23:10:30,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:10:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2025-03-08 23:10:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:10:30,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:30,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:30,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:10:30,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:30,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -902931890, now seen corresponding path program 1 times [2025-03-08 23:10:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571637744] [2025-03-08 23:10:30,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:30,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:10:30,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:10:30,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:30,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:31,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571637744] [2025-03-08 23:10:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571637744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:10:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132313502] [2025-03-08 23:10:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:31,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:10:31,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:31,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:10:31,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:31,063 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:10:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:31,228 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2025-03-08 23:10:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:10:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 23:10:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:31,229 INFO L225 Difference]: With dead ends: 123 [2025-03-08 23:10:31,229 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 23:10:31,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:31,230 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:31,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 396 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:10:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 23:10:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-08 23:10:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 118 states have internal predecessors, (126), 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) [2025-03-08 23:10:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2025-03-08 23:10:31,236 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2025-03-08 23:10:31,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:31,236 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2025-03-08 23:10:31,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:10:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2025-03-08 23:10:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:10:31,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:31,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:31,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:10:31,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash -902931889, now seen corresponding path program 1 times [2025-03-08 23:10:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120472552] [2025-03-08 23:10:31,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:31,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:10:31,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:10:31,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:31,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:10:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120472552] [2025-03-08 23:10:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120472552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:10:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101788550] [2025-03-08 23:10:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:10:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:10:31,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:31,415 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:10:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:31,546 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2025-03-08 23:10:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:10:31,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 23:10:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:31,547 INFO L225 Difference]: With dead ends: 122 [2025-03-08 23:10:31,547 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 23:10:31,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:31,548 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:31,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 23:10:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 23:10:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.838235294117647) internal successors, (125), 117 states have internal predecessors, (125), 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) [2025-03-08 23:10:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2025-03-08 23:10:31,553 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 22 [2025-03-08 23:10:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2025-03-08 23:10:31,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:10:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2025-03-08 23:10:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:10:31,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:31,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:31,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:10:31,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:31,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:31,554 INFO L85 PathProgramCache]: Analyzing trace with hash 136333414, now seen corresponding path program 1 times [2025-03-08 23:10:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:31,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092418584] [2025-03-08 23:10:31,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:31,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:10:31,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:10:31,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:31,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:10:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092418584] [2025-03-08 23:10:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092418584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:31,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180181491] [2025-03-08 23:10:31,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:31,753 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) [2025-03-08 23:10:31,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:10:31,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:10:31,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:10:31,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:31,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:31,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:10:31,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:31,869 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 [2025-03-08 23:10:31,914 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:10:31,971 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:10:31,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 23:10:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:10:31,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:32,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180181491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:32,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-08 23:10:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189300520] [2025-03-08 23:10:32,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:32,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:10:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:32,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:10:32,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-08 23:10:32,045 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:32,311 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2025-03-08 23:10:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:10:32,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 23:10:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:32,324 INFO L225 Difference]: With dead ends: 121 [2025-03-08 23:10:32,324 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 23:10:32,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:10:32,324 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:32,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 582 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 123 Unchecked, 0.2s Time] [2025-03-08 23:10:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 23:10:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 23:10:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 116 states have internal predecessors, (124), 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) [2025-03-08 23:10:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2025-03-08 23:10:32,329 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 25 [2025-03-08 23:10:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:32,329 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2025-03-08 23:10:32,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2025-03-08 23:10:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:10:32,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:32,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:32,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 23:10:32,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 23:10:32,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:32,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash 136333415, now seen corresponding path program 1 times [2025-03-08 23:10:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:32,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645474257] [2025-03-08 23:10:32,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:32,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:10:32,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:10:32,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:32,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645474257] [2025-03-08 23:10:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645474257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318622845] [2025-03-08 23:10:32,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:32,856 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) [2025-03-08 23:10:32,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:10:32,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:10:32,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:10:32,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:32,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:32,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 23:10:32,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:32,957 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 [2025-03-08 23:10:33,082 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:10:33,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:33,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:10:33,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:33,120 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 [2025-03-08 23:10:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:33,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318622845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:33,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-08 23:10:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131379455] [2025-03-08 23:10:33,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 23:10:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:33,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 23:10:33,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2025-03-08 23:10:33,256 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:10:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:33,628 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2025-03-08 23:10:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:10:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-03-08 23:10:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:33,630 INFO L225 Difference]: With dead ends: 128 [2025-03-08 23:10:33,630 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 23:10:33,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2025-03-08 23:10:33,630 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:33,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 602 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 549 Invalid, 0 Unknown, 134 Unchecked, 0.3s Time] [2025-03-08 23:10:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 23:10:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-08 23:10:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:10:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-03-08 23:10:33,642 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 25 [2025-03-08 23:10:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:33,643 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-03-08 23:10:33,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:10:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-03-08 23:10:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:10:33,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:33,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:33,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:33,851 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,SelfDestructingSolverStorable6 [2025-03-08 23:10:33,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1793554357, now seen corresponding path program 2 times [2025-03-08 23:10:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974064935] [2025-03-08 23:10:33,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:33,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 23:10:33,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:10:33,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:33,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 23:10:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974064935] [2025-03-08 23:10:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974064935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704941539] [2025-03-08 23:10:33,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:33,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:33,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:33,933 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) [2025-03-08 23:10:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:10:33,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 23:10:34,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:10:34,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:34,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:34,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:10:34,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 23:10:34,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:10:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704941539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:34,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:10:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 23:10:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025817564] [2025-03-08 23:10:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:34,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:10:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:34,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:10:34,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:10:34,042 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:34,054 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2025-03-08 23:10:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:10:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 37 [2025-03-08 23:10:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:34,055 INFO L225 Difference]: With dead ends: 120 [2025-03-08 23:10:34,055 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 23:10:34,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:10:34,056 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:34,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:10:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 23:10:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-08 23:10:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.7941176470588236) internal successors, (122), 115 states have internal predecessors, (122), 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) [2025-03-08 23:10:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2025-03-08 23:10:34,059 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 37 [2025-03-08 23:10:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:34,059 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2025-03-08 23:10:34,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2025-03-08 23:10:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:10:34,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:34,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:34,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:34,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:34,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1818202822, now seen corresponding path program 1 times [2025-03-08 23:10:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228755373] [2025-03-08 23:10:34,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:10:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:10:34,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:34,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:34,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228755373] [2025-03-08 23:10:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228755373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909848908] [2025-03-08 23:10:34,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:34,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:34,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:34,620 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) [2025-03-08 23:10:34,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:10:34,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:10:34,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:10:34,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:34,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:34,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 23:10:34,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:34,733 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 [2025-03-08 23:10:34,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:34,770 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:10:34,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-03-08 23:10:34,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-08 23:10:34,834 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-03-08 23:10:34,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:34,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 23:10:34,909 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-08 23:10:34,927 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:10:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2025-03-08 23:10:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2025-03-08 23:10:34,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909848908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:35,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:35,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2025-03-08 23:10:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153169656] [2025-03-08 23:10:35,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:35,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 23:10:35,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:35,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 23:10:35,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=316, Unknown=2, NotChecked=74, Total=462 [2025-03-08 23:10:35,127 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 23:10:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:35,565 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2025-03-08 23:10:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:10:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2025-03-08 23:10:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:35,566 INFO L225 Difference]: With dead ends: 129 [2025-03-08 23:10:35,566 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 23:10:35,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=415, Unknown=2, NotChecked=86, Total=600 [2025-03-08 23:10:35,567 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 400 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:35,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 555 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 664 Invalid, 0 Unknown, 264 Unchecked, 0.4s Time] [2025-03-08 23:10:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 23:10:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2025-03-08 23:10:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.661764705882353) internal successors, (113), 106 states have internal predecessors, (113), 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) [2025-03-08 23:10:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2025-03-08 23:10:35,570 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 37 [2025-03-08 23:10:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:35,571 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2025-03-08 23:10:35,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 23:10:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2025-03-08 23:10:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:10:35,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:35,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:35,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 23:10:35,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:35,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1818202821, now seen corresponding path program 1 times [2025-03-08 23:10:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-03-08 23:10:35,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:35,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:10:35,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:10:35,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:35,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:10:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-03-08 23:10:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135714428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401341081] [2025-03-08 23:10:36,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:36,111 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) [2025-03-08 23:10:36,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:10:36,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:10:36,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:10:36,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:36,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:36,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 23:10:36,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:36,223 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 8 treesize of output 1 [2025-03-08 23:10:36,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:36,253 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-08 23:10:36,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:36,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:10:36,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:36,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:36,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:10:36,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:36,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:36,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:10:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:10:36,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:10:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401341081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:36,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:10:36,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-03-08 23:10:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132520617] [2025-03-08 23:10:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:36,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:10:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:36,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:10:36,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-03-08 23:10:36,419 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:36,534 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2025-03-08 23:10:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:10:36,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 23:10:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:36,535 INFO L225 Difference]: With dead ends: 105 [2025-03-08 23:10:36,535 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 23:10:36,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2025-03-08 23:10:36,536 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 21 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:36,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 266 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 141 Unchecked, 0.1s Time] [2025-03-08 23:10:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 23:10:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 23:10:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 100 states have internal predecessors, (107), 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) [2025-03-08 23:10:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-03-08 23:10:36,540 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 37 [2025-03-08 23:10:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:36,541 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-03-08 23:10:36,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-03-08 23:10:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 23:10:36,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:36,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:36,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:36,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 23:10:36,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2047316501, now seen corresponding path program 1 times [2025-03-08 23:10:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204559794] [2025-03-08 23:10:36,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:36,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 23:10:36,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 23:10:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 23:10:36,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204559794] [2025-03-08 23:10:36,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204559794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:36,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:10:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928268734] [2025-03-08 23:10:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:36,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:10:36,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:36,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:10:36,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:36,814 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:10:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:36,915 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-03-08 23:10:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:10:36,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-08 23:10:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:36,916 INFO L225 Difference]: With dead ends: 103 [2025-03-08 23:10:36,916 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 23:10:36,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:36,917 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:36,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 319 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 23:10:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 23:10:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 98 states have internal predecessors, (105), 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) [2025-03-08 23:10:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2025-03-08 23:10:36,919 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 40 [2025-03-08 23:10:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:36,920 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2025-03-08 23:10:36,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:10:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2025-03-08 23:10:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 23:10:36,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:36,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:36,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:10:36,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:36,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2047316502, now seen corresponding path program 1 times [2025-03-08 23:10:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:36,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334385892] [2025-03-08 23:10:36,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:36,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 23:10:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 23:10:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:10:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334385892] [2025-03-08 23:10:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334385892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208791508] [2025-03-08 23:10:37,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:37,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:37,055 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) [2025-03-08 23:10:37,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:10:37,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 23:10:37,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 23:10:37,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:37,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:37,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:10:37,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:37,183 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 8 treesize of output 1 [2025-03-08 23:10:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:10:37,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:10:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208791508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:10:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-08 23:10:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244581161] [2025-03-08 23:10:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:37,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:10:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:10:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:10:37,258 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:10:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:37,368 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-03-08 23:10:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:10:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-08 23:10:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:37,369 INFO L225 Difference]: With dead ends: 101 [2025-03-08 23:10:37,369 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 23:10:37,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:10:37,370 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 19 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:37,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 331 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 23:10:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 23:10:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 96 states have internal predecessors, (103), 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) [2025-03-08 23:10:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-03-08 23:10:37,372 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 40 [2025-03-08 23:10:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:37,373 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-03-08 23:10:37,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:10:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-03-08 23:10:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:10:37,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:37,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:37,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:37,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:37,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:37,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -956712717, now seen corresponding path program 1 times [2025-03-08 23:10:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479624873] [2025-03-08 23:10:37,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:37,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:10:37,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:10:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479624873] [2025-03-08 23:10:37,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479624873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367269339] [2025-03-08 23:10:37,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:37,802 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) [2025-03-08 23:10:37,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:10:37,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:10:37,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:10:37,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:37,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 23:10:37,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:38,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 23:10:38,065 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-08 23:10:38,081 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 23:10:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 23:10:38,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 23:10:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 23:10:38,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:10:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367269339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:10:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-03-08 23:10:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887102214] [2025-03-08 23:10:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:38,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:10:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:10:38,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-03-08 23:10:38,113 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:38,270 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-03-08 23:10:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 23:10:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (3), 2 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 41 [2025-03-08 23:10:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:38,270 INFO L225 Difference]: With dead ends: 100 [2025-03-08 23:10:38,271 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 23:10:38,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-03-08 23:10:38,271 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 26 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:38,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 400 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 167 Unchecked, 0.1s Time] [2025-03-08 23:10:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 23:10:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 23:10:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 95 states have internal predecessors, (103), 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) [2025-03-08 23:10:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-03-08 23:10:38,273 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 41 [2025-03-08 23:10:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:38,274 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-03-08 23:10:38,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-03-08 23:10:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:10:38,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:38,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:38,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 23:10:38,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:38,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash -956712716, now seen corresponding path program 1 times [2025-03-08 23:10:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-03-08 23:10:38,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:38,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:10:38,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:10:38,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:38,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:10:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-03-08 23:10:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329577176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059219255] [2025-03-08 23:10:38,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:38,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:38,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:38,844 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:38,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 23:10:38,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:10:39,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:10:39,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:39,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:39,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 23:10:39,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:39,038 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 8 treesize of output 1 [2025-03-08 23:10:39,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 23:10:39,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 23:10:39,278 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-08 23:10:39,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 23:10:39,320 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:10:39,320 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 15 treesize of output 15 [2025-03-08 23:10:39,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 23:10:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:10:39,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059219255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:39,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2025-03-08 23:10:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016107889] [2025-03-08 23:10:39,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:39,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 23:10:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:39,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 23:10:39,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1090, Unknown=1, NotChecked=66, Total=1260 [2025-03-08 23:10:39,655 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 31 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:10:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:40,476 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2025-03-08 23:10:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 23:10:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-08 23:10:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:40,477 INFO L225 Difference]: With dead ends: 115 [2025-03-08 23:10:40,477 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 23:10:40,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=2058, Unknown=1, NotChecked=92, Total=2352 [2025-03-08 23:10:40,478 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 151 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:40,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1064 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1167 Invalid, 0 Unknown, 117 Unchecked, 0.5s Time] [2025-03-08 23:10:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 23:10:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 23:10:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 109 states have internal predecessors, (117), 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) [2025-03-08 23:10:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2025-03-08 23:10:40,481 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 41 [2025-03-08 23:10:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2025-03-08 23:10:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:10:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2025-03-08 23:10:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 23:10:40,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:40,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:40,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 23:10:40,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 23:10:40,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:40,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash 376137267, now seen corresponding path program 1 times [2025-03-08 23:10:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:40,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880788667] [2025-03-08 23:10:40,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:40,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:10:40,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:10:40,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:40,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:10:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880788667] [2025-03-08 23:10:40,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880788667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454823364] [2025-03-08 23:10:40,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:40,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:40,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:40,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 23:10:40,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:10:40,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:10:40,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:40,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:40,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 23:10:40,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:40,970 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 8 treesize of output 1 [2025-03-08 23:10:40,976 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 [2025-03-08 23:10:40,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:40,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:41,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:41,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:10:41,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:41,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:10:41,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:41,152 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 11 treesize of output 7 [2025-03-08 23:10:41,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:41,212 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:10:41,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2025-03-08 23:10:41,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:41,236 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 23:10:41,236 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 16 treesize of output 18 [2025-03-08 23:10:41,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:41,337 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-08 23:10:41,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:41,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:10:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-03-08 23:10:41,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454823364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:41,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:41,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2025-03-08 23:10:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106909546] [2025-03-08 23:10:41,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:41,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 23:10:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:41,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 23:10:41,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2025-03-08 23:10:41,477 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 23:10:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:41,977 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2025-03-08 23:10:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:10:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-03-08 23:10:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:41,977 INFO L225 Difference]: With dead ends: 110 [2025-03-08 23:10:41,977 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 23:10:41,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=856, Unknown=1, NotChecked=60, Total=1056 [2025-03-08 23:10:41,978 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 130 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:41,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 810 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 795 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2025-03-08 23:10:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 23:10:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 23:10:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 104 states have internal predecessors, (111), 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) [2025-03-08 23:10:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2025-03-08 23:10:41,981 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 42 [2025-03-08 23:10:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:41,981 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2025-03-08 23:10:41,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 23:10:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2025-03-08 23:10:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:10:41,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:41,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:41,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 23:10:42,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 23:10:42,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:42,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1259063610, now seen corresponding path program 1 times [2025-03-08 23:10:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113758332] [2025-03-08 23:10:42,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:42,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:42,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:42,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:42,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113758332] [2025-03-08 23:10:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113758332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497005869] [2025-03-08 23:10:42,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:42,904 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:42,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 23:10:42,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:43,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:43,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:43,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:43,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-08 23:10:43,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:43,079 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 [2025-03-08 23:10:43,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:43,205 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 [2025-03-08 23:10:43,266 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 [2025-03-08 23:10:43,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:43,370 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 34 treesize of output 33 [2025-03-08 23:10:43,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 23:10:43,500 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 [2025-03-08 23:10:43,642 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (<= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2025-03-08 23:10:43,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:43,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-08 23:10:43,682 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-03-08 23:10:43,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-03-08 23:10:43,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:43,884 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 46 treesize of output 26 [2025-03-08 23:10:43,929 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 13 [2025-03-08 23:10:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:43,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:44,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497005869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:44,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:44,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 47 [2025-03-08 23:10:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355576698] [2025-03-08 23:10:44,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:44,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 23:10:44,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:44,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 23:10:44,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2399, Unknown=1, NotChecked=98, Total=2652 [2025-03-08 23:10:44,187 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 48 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 41 states have internal predecessors, (76), 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) [2025-03-08 23:10:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:45,338 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-03-08 23:10:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 23:10:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 41 states have internal predecessors, (76), 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 46 [2025-03-08 23:10:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:45,339 INFO L225 Difference]: With dead ends: 112 [2025-03-08 23:10:45,339 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 23:10:45,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=321, Invalid=4374, Unknown=1, NotChecked=134, Total=4830 [2025-03-08 23:10:45,340 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 123 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:45,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1487 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1662 Invalid, 0 Unknown, 114 Unchecked, 0.6s Time] [2025-03-08 23:10:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 23:10:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 23:10:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 106 states have internal predecessors, (114), 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) [2025-03-08 23:10:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-08 23:10:45,342 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 46 [2025-03-08 23:10:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:45,343 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-08 23:10:45,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 41 states have internal predecessors, (76), 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) [2025-03-08 23:10:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-08 23:10:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:10:45,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:45,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:45,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:45,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 23:10:45,544 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1259063611, now seen corresponding path program 1 times [2025-03-08 23:10:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922109630] [2025-03-08 23:10:45,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:45,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:45,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:45,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:46,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:46,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922109630] [2025-03-08 23:10:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922109630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:46,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380400415] [2025-03-08 23:10:46,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:46,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:46,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:46,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 23:10:46,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:46,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:46,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:46,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:46,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-03-08 23:10:46,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:46,644 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 [2025-03-08 23:10:46,648 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 8 treesize of output 1 [2025-03-08 23:10:46,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:46,877 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 [2025-03-08 23:10:46,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:10:46,982 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 [2025-03-08 23:10:46,985 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 [2025-03-08 23:10:47,108 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:47,109 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 59 treesize of output 52 [2025-03-08 23:10:47,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:10:47,255 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 43 treesize of output 19 [2025-03-08 23:10:47,258 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 5 treesize of output 3 [2025-03-08 23:10:47,261 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 [2025-03-08 23:10:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 23:10:47,421 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2025-03-08 23:10:47,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:47,447 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 51 treesize of output 34 [2025-03-08 23:10:47,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:47,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2025-03-08 23:10:47,464 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:47,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:47,467 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 [2025-03-08 23:10:47,684 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 48 treesize of output 28 [2025-03-08 23:10:47,741 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 13 [2025-03-08 23:10:47,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:10:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:47,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:48,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380400415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:48,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:48,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2025-03-08 23:10:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603385717] [2025-03-08 23:10:48,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:48,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 23:10:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:48,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 23:10:48,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3023, Unknown=1, NotChecked=110, Total=3306 [2025-03-08 23:10:48,165 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 51 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 44 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:49,937 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2025-03-08 23:10:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 23:10:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 44 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-03-08 23:10:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:49,938 INFO L225 Difference]: With dead ends: 120 [2025-03-08 23:10:49,939 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 23:10:49,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=342, Invalid=5667, Unknown=1, NotChecked=152, Total=6162 [2025-03-08 23:10:49,940 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 129 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:49,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1823 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2343 Invalid, 0 Unknown, 122 Unchecked, 0.9s Time] [2025-03-08 23:10:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 23:10:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2025-03-08 23:10:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 109 states have internal predecessors, (117), 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) [2025-03-08 23:10:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2025-03-08 23:10:49,944 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 46 [2025-03-08 23:10:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:49,944 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2025-03-08 23:10:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 44 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2025-03-08 23:10:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:10:49,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:49,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:49,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 23:10:50,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 23:10:50,145 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:50,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1223413075, now seen corresponding path program 2 times [2025-03-08 23:10:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027855358] [2025-03-08 23:10:50,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:50,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:10:50,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:50,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:50,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027855358] [2025-03-08 23:10:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027855358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99128908] [2025-03-08 23:10:50,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:50,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:50,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:50,936 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:50,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 23:10:51,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:10:51,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:51,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:51,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:51,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-08 23:10:51,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:51,092 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 [2025-03-08 23:10:51,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:51,266 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 [2025-03-08 23:10:51,331 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 [2025-03-08 23:10:51,335 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 [2025-03-08 23:10:51,428 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 23:10:51,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2025-03-08 23:10:51,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:10:51,579 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:10:51,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2025-03-08 23:10:51,584 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 [2025-03-08 23:10:51,587 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 [2025-03-08 23:10:51,718 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-03-08 23:10:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:51,749 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 23:10:51,749 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 57 treesize of output 46 [2025-03-08 23:10:51,761 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:51,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:51,767 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 [2025-03-08 23:10:51,850 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:10:51,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:51,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2025-03-08 23:10:52,055 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 [2025-03-08 23:10:52,178 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 23:10:52,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2025-03-08 23:10:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:52,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:52,219 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-03-08 23:10:52,219 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 24 treesize of output 23 [2025-03-08 23:10:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99128908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:52,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 53 [2025-03-08 23:10:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809890941] [2025-03-08 23:10:52,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:52,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 23:10:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:52,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 23:10:52,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2802, Unknown=1, NotChecked=106, Total=3080 [2025-03-08 23:10:52,317 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:53,586 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2025-03-08 23:10:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 23:10:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2025-03-08 23:10:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:53,587 INFO L225 Difference]: With dead ends: 119 [2025-03-08 23:10:53,587 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 23:10:53,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=335, Invalid=5070, Unknown=1, NotChecked=144, Total=5550 [2025-03-08 23:10:53,588 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 156 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:53,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1808 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1994 Invalid, 0 Unknown, 122 Unchecked, 0.7s Time] [2025-03-08 23:10:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 23:10:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2025-03-08 23:10:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 111 states have internal predecessors, (120), 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) [2025-03-08 23:10:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2025-03-08 23:10:53,590 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 51 [2025-03-08 23:10:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:53,590 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2025-03-08 23:10:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2025-03-08 23:10:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:10:53,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:53,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:53,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 23:10:53,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 23:10:53,792 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1223413076, now seen corresponding path program 2 times [2025-03-08 23:10:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586909754] [2025-03-08 23:10:53,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:53,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:10:53,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:53,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:53,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586909754] [2025-03-08 23:10:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586909754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066857713] [2025-03-08 23:10:54,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:54,653 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:54,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 23:10:54,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:10:54,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:54,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:54,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:54,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-08 23:10:54,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:54,821 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 [2025-03-08 23:10:54,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:54,992 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 [2025-03-08 23:10:55,065 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 [2025-03-08 23:10:55,070 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 [2025-03-08 23:10:55,176 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 23:10:55,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-03-08 23:10:55,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-08 23:10:55,323 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:10:55,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-03-08 23:10:55,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 23:10:55,328 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 [2025-03-08 23:10:55,475 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-03-08 23:10:55,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:55,497 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 23:10:55,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-03-08 23:10:55,516 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-08 23:10:55,972 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-03-08 23:10:55,972 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 69 treesize of output 35 [2025-03-08 23:10:56,030 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 34 treesize of output 18 [2025-03-08 23:10:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:56,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:56,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066857713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:56,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:56,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2025-03-08 23:10:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314789530] [2025-03-08 23:10:56,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:56,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 23:10:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:56,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 23:10:56,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2595, Unknown=1, NotChecked=102, Total=2862 [2025-03-08 23:10:56,206 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:57,402 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2025-03-08 23:10:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 23:10:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2025-03-08 23:10:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:57,403 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:10:57,403 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:10:57,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=306, Invalid=4389, Unknown=1, NotChecked=134, Total=4830 [2025-03-08 23:10:57,404 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 71 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:57,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1827 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1562 Invalid, 0 Unknown, 105 Unchecked, 0.7s Time] [2025-03-08 23:10:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:10:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-08 23:10:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 94 states have internal predecessors, (100), 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) [2025-03-08 23:10:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2025-03-08 23:10:57,406 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2025-03-08 23:10:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:57,407 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2025-03-08 23:10:57,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2025-03-08 23:10:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 23:10:57,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:57,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:57,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 23:10:57,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:57,608 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:57,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash 486234309, now seen corresponding path program 1 times [2025-03-08 23:10:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:57,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634885133] [2025-03-08 23:10:57,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:57,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:57,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 23:10:57,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 23:10:57,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:57,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 23:10:57,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634885133] [2025-03-08 23:10:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634885133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:57,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:57,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:10:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978867075] [2025-03-08 23:10:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:57,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:10:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:57,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:10:57,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:10:57,757 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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) [2025-03-08 23:10:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:57,886 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-03-08 23:10:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:10:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 53 [2025-03-08 23:10:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:57,887 INFO L225 Difference]: With dead ends: 101 [2025-03-08 23:10:57,887 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 23:10:57,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:10:57,888 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:57,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 354 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 23:10:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-08 23:10:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 91 states have internal predecessors, (97), 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) [2025-03-08 23:10:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2025-03-08 23:10:57,893 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 53 [2025-03-08 23:10:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:57,893 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2025-03-08 23:10:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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) [2025-03-08 23:10:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2025-03-08 23:10:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 23:10:57,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:57,893 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:57,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:10:57,894 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:57,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash 486234310, now seen corresponding path program 1 times [2025-03-08 23:10:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405481032] [2025-03-08 23:10:57,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:57,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 23:10:57,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 23:10:57,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:57,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:10:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405481032] [2025-03-08 23:10:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405481032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:58,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 23:10:58,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92905914] [2025-03-08 23:10:58,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:58,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 23:10:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:58,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 23:10:58,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:10:58,153 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 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) [2025-03-08 23:10:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:58,269 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-03-08 23:10:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 23:10:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 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 53 [2025-03-08 23:10:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:58,270 INFO L225 Difference]: With dead ends: 99 [2025-03-08 23:10:58,270 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 23:10:58,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:10:58,270 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 40 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:58,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 449 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 23:10:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-08 23:10:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 89 states have internal predecessors, (95), 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) [2025-03-08 23:10:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-03-08 23:10:58,272 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 53 [2025-03-08 23:10:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:58,272 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-03-08 23:10:58,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 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) [2025-03-08 23:10:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-03-08 23:10:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 23:10:58,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:58,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:58,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 23:10:58,275 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:10:58,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 175542603, now seen corresponding path program 1 times [2025-03-08 23:10:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939381886] [2025-03-08 23:10:58,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:58,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:10:58,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:10:58,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939381886] [2025-03-08 23:10:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939381886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:58,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934766904] [2025-03-08 23:10:58,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:58,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:58,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:58,940 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:58,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 23:10:59,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:10:59,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:10:59,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:59,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:59,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-08 23:10:59,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:59,123 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 [2025-03-08 23:10:59,212 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:59,212 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 [2025-03-08 23:10:59,255 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 [2025-03-08 23:10:59,327 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:59,327 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 25 treesize of output 26 [2025-03-08 23:10:59,423 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 [2025-03-08 23:10:59,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 23:10:59,471 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:10:59,471 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 29 treesize of output 32 [2025-03-08 23:10:59,473 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 14 treesize of output 8 [2025-03-08 23:10:59,486 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:10:59,487 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 15 treesize of output 15 [2025-03-08 23:10:59,604 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,604 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 28 treesize of output 20 [2025-03-08 23:10:59,692 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:59,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:59,694 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 28 treesize of output 15 [2025-03-08 23:10:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:59,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:11:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934766904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:00,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:11:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 45 [2025-03-08 23:11:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649183805] [2025-03-08 23:11:00,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:11:00,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 23:11:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:11:00,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 23:11:00,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2484, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 23:11:00,008 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:11:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:11:00,763 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2025-03-08 23:11:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:11:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 3 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 57 [2025-03-08 23:11:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:11:00,767 INFO L225 Difference]: With dead ends: 95 [2025-03-08 23:11:00,767 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 23:11:00,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=3963, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 23:11:00,768 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:11:00,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1596 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:11:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 23:11:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 23:11:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 89 states have internal predecessors, (94), 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) [2025-03-08 23:11:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2025-03-08 23:11:00,772 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 57 [2025-03-08 23:11:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:11:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2025-03-08 23:11:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:11:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2025-03-08 23:11:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 23:11:00,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:11:00,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:11:00,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 23:11:00,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:00,973 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:11:00,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:11:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash 663040914, now seen corresponding path program 1 times [2025-03-08 23:11:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:11:00,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600696005] [2025-03-08 23:11:00,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:11:00,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:11:00,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:11:00,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:11:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600696005] [2025-03-08 23:11:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600696005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287611545] [2025-03-08 23:11:02,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:02,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:11:02,522 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:11:02,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 23:11:02,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:11:02,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:11:02,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:02,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-08 23:11:02,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:11:02,717 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 [2025-03-08 23:11:02,901 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:11:02,902 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 [2025-03-08 23:11:02,973 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 [2025-03-08 23:11:03,058 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:11:03,058 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 34 treesize of output 33 [2025-03-08 23:11:03,207 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 [2025-03-08 23:11:03,209 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 [2025-03-08 23:11:03,327 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 [2025-03-08 23:11:03,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:03,420 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 [2025-03-08 23:11:03,431 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-08 23:11:03,431 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 [2025-03-08 23:11:03,899 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:03,902 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2025-03-08 23:11:03,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 19 [2025-03-08 23:11:04,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:11:04,123 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:04,123 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:04,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 23:11:04,126 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 [2025-03-08 23:11:04,201 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 [2025-03-08 23:11:04,301 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:04,302 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 19 treesize of output 11 [2025-03-08 23:11:04,305 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:04,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:04,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-03-08 23:11:04,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:11:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:04,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:11:04,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2133) (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)) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2025-03-08 23:11:04,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2130) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2133) (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)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_2130 (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| (select v_ArrVal_2130 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2025-03-08 23:11:04,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (or (not (= v_ArrVal_2130 (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| (select v_ArrVal_2130 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2130) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2133) (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)) |c_ULTIMATE.start_main_~uneq~0#1|))) is different from false [2025-03-08 23:11:04,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (or (not (= v_ArrVal_2130 (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| (select v_ArrVal_2130 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2130) (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_2133) (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 [2025-03-08 23:11:04,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (or (not (= v_ArrVal_2130 (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| (select v_ArrVal_2130 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2130) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2133) (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 [2025-03-08 23:11:04,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (or (not (= v_ArrVal_2130 (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| (select v_ArrVal_2130 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2130) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2133) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2025-03-08 23:11:04,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:04,843 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 522 treesize of output 512 [2025-03-08 23:11:04,856 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 103 treesize of output 71 [2025-03-08 23:11:04,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 23:11:04,892 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 138 treesize of output 122 [2025-03-08 23:11:05,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287611545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:05,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:11:05,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 34] total 67 [2025-03-08 23:11:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120988152] [2025-03-08 23:11:05,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:11:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 23:11:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:11:05,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 23:11:05,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=5160, Unknown=21, NotChecked=894, Total=6320 [2025-03-08 23:11:05,047 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 67 states, 64 states have (on average 1.640625) internal successors, (105), 58 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:11:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:11:06,907 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-03-08 23:11:06,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 23:11:06,907 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.640625) internal successors, (105), 58 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2025-03-08 23:11:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:11:06,908 INFO L225 Difference]: With dead ends: 95 [2025-03-08 23:11:06,908 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 23:11:06,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=468, Invalid=9635, Unknown=21, NotChecked=1218, Total=11342 [2025-03-08 23:11:06,909 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 59 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 23:11:06,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2206 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 23:11:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 23:11:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 23:11:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.24) internal successors, (93), 89 states have internal predecessors, (93), 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) [2025-03-08 23:11:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2025-03-08 23:11:06,911 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 62 [2025-03-08 23:11:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:11:06,911 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-03-08 23:11:06,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.640625) internal successors, (105), 58 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:11:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2025-03-08 23:11:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 23:11:06,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:11:06,912 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:11:06,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 23:11:07,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:07,112 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:11:07,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:11:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 663121347, now seen corresponding path program 1 times [2025-03-08 23:11:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:11:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826086733] [2025-03-08 23:11:07,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:11:07,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:11:07,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:11:07,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:07,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:08,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:11:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826086733] [2025-03-08 23:11:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826086733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678411599] [2025-03-08 23:11:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:08,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:11:08,298 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:11:08,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 23:11:08,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:11:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:11:08,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:08,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:08,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-08 23:11:08,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:11:08,494 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 [2025-03-08 23:11:08,588 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:11:08,588 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 [2025-03-08 23:11:08,643 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 [2025-03-08 23:11:08,720 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:11:08,720 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 34 treesize of output 33 [2025-03-08 23:11:08,843 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 [2025-03-08 23:11:08,845 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 [2025-03-08 23:11:08,890 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-08 23:11:08,891 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 [2025-03-08 23:11:08,906 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_main_~#s~0#1.offset| 0) (<= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| |c_#memory_$Pointer$#1.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse2) .cse3))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= .cse1 .cse2))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (and (not (= .cse4 .cse2)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2)))) is different from false [2025-03-08 23:11:08,908 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_main_~#s~0#1.offset| 0) (<= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| |c_#memory_$Pointer$#1.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse2) .cse3))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= .cse1 .cse2))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (and (not (= .cse4 .cse2)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2)))) is different from true [2025-03-08 23:11:09,510 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:09,512 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-08 23:11:09,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2025-03-08 23:11:09,600 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:09,601 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 79 [2025-03-08 23:11:09,604 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:09,605 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:09,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2025-03-08 23:11:09,693 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-03-08 23:11:09,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 85 [2025-03-08 23:11:09,794 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:09,795 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 101 treesize of output 69 [2025-03-08 23:11:09,797 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:09,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:09,799 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 73 treesize of output 52 [2025-03-08 23:11:09,931 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:11:09,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-03-08 23:11:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:09,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:11:14,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2297 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2297) (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| |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|))) 1)) is different from false [2025-03-08 23:11:18,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2297 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2297) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-08 23:11:18,265 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2297 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (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_2297) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-08 23:11:18,284 INFO L349 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2025-03-08 23:11:18,284 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 59 treesize of output 58 [2025-03-08 23:11:18,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2297 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)) (select (select |c_#memory_$Pointer$#1.base| .cse0) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2297) (select (select (store |c_#memory_$Pointer$#2.base| |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.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|))) .cse0)))) is different from false [2025-03-08 23:11:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678411599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:18,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:11:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 61 [2025-03-08 23:11:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678606225] [2025-03-08 23:11:18,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:11:18,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-08 23:11:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:11:18,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-08 23:11:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4362, Unknown=95, NotChecked=690, Total=5402 [2025-03-08 23:11:18,826 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 62 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 54 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:11:19,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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|)) (.cse3 (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_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) (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.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| |c_#memory_$Pointer$#1.base|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (not (= .cse2 .cse3))))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (not (= .cse5 .cse3)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse5)))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)))) is different from false [2025-03-08 23:11:19,258 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (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|)) (.cse3 (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_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) (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.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| |c_#memory_$Pointer$#1.base|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_46| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (not (= .cse2 .cse3))))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (not (= .cse5 .cse3)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse5)))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)))) is different from true [2025-03-08 23:11:23,584 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] [2025-03-08 23:11:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:11:24,230 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2025-03-08 23:11:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 23:11:24,231 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 54 states have internal predecessors, (98), 6 states have call successors, (6), 3 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 62 [2025-03-08 23:11:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:11:24,231 INFO L225 Difference]: With dead ends: 100 [2025-03-08 23:11:24,231 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 23:11:24,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=423, Invalid=6813, Unknown=98, NotChecked=1038, Total=8372 [2025-03-08 23:11:24,232 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 98 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:11:24,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1532 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2051 Invalid, 1 Unknown, 155 Unchecked, 4.7s Time] [2025-03-08 23:11:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 23:11:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-08 23:11:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 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) [2025-03-08 23:11:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2025-03-08 23:11:24,234 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 62 [2025-03-08 23:11:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:11:24,234 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2025-03-08 23:11:24,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 54 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:11:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2025-03-08 23:11:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 23:11:24,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:11:24,235 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:11:24,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 23:11:24,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 23:11:24,435 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:11:24,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:11:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 663121348, now seen corresponding path program 1 times [2025-03-08 23:11:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:11:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316805146] [2025-03-08 23:11:24,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:11:24,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:11:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:11:24,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:11:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316805146] [2025-03-08 23:11:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316805146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475425278] [2025-03-08 23:11:25,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:11:25,794 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:11:25,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 23:11:25,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:11:25,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:11:25,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:25,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:25,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-03-08 23:11:25,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:11:25,994 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 [2025-03-08 23:11:26,064 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 8 treesize of output 1 [2025-03-08 23:11:26,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:11:26,152 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 [2025-03-08 23:11:26,228 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 [2025-03-08 23:11:26,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:11:26,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:11:26,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 23:11:26,509 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 [2025-03-08 23:11:26,512 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 [2025-03-08 23:11:26,772 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:11:26,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 21 [2025-03-08 23:11:26,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:26,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-08 23:11:26,798 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:11:26,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:11:28,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:28,010 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 31 treesize of output 30 [2025-03-08 23:11:28,018 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:28,018 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:28,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2025-03-08 23:11:28,186 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:28,200 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2025-03-08 23:11:28,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 94 [2025-03-08 23:11:28,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:28,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:28,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 59 [2025-03-08 23:11:28,334 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-03-08 23:11:28,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 127 [2025-03-08 23:11:28,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 71 [2025-03-08 23:11:28,498 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:28,499 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 178 treesize of output 130 [2025-03-08 23:11:28,502 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 141 treesize of output 93 [2025-03-08 23:11:28,664 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:11:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 42 [2025-03-08 23:11:28,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2025-03-08 23:11:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:28,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:11:33,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (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 ((.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse2) .cse3))) (and (forall ((v_ArrVal_2461 (Array Int Int))) (<= (+ .cse0 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2461) .cse2) .cse3)))) (<= 0 (+ .cse0 4)))))) is different from false [2025-03-08 23:11:33,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:33,972 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 1629 treesize of output 1500 [2025-03-08 23:11:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475425278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:36,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:11:36,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 66 [2025-03-08 23:11:36,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241948611] [2025-03-08 23:11:36,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:11:36,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 23:11:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:11:36,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 23:11:36,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=6653, Unknown=37, NotChecked=164, Total=7140 [2025-03-08 23:11:36,707 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 67 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 58 states have internal predecessors, (108), 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) [2025-03-08 23:11:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:11:40,219 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2025-03-08 23:11:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 23:11:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 58 states have internal predecessors, (108), 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 62 [2025-03-08 23:11:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:11:40,220 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:11:40,220 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:11:40,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=559, Invalid=12063, Unknown=38, NotChecked=222, Total=12882 [2025-03-08 23:11:40,220 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:11:40,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2045 Invalid, 2751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 23:11:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:11:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-08 23:11:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 92 states have internal predecessors, (97), 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) [2025-03-08 23:11:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-03-08 23:11:40,223 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 62 [2025-03-08 23:11:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:11:40,223 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-03-08 23:11:40,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 58 states have internal predecessors, (108), 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) [2025-03-08 23:11:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-03-08 23:11:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 23:11:40,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:11:40,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:11:40,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 23:11:40,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:40,424 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-08 23:11:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:11:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -11667660, now seen corresponding path program 1 times [2025-03-08 23:11:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:11:40,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874821908] [2025-03-08 23:11:40,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:11:40,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 23:11:40,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 23:11:40,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:40,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:42,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:11:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874821908] [2025-03-08 23:11:42,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874821908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:11:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496456526] [2025-03-08 23:11:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:11:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:11:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:11:42,950 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:11:42,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 23:11:43,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 23:11:43,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 23:11:43,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:43,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:43,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 146 conjuncts are in the unsatisfiable core [2025-03-08 23:11:43,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:11:43,166 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 [2025-03-08 23:11:43,334 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 [2025-03-08 23:11:43,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:11:43,426 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 [2025-03-08 23:11:43,537 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 [2025-03-08 23:11:43,540 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 [2025-03-08 23:11:43,669 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:11:43,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 23:11:43,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:11:43,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 23:11:43,894 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 [2025-03-08 23:11:43,909 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 [2025-03-08 23:11:44,237 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:11:44,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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-08 23:11:44,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:44,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-08 23:11:44,258 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:11:44,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:11:45,442 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 [2025-03-08 23:11:45,450 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 15 treesize of output 11 [2025-03-08 23:11:45,459 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:45,459 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:45,460 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2025-03-08 23:11:45,640 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:45,657 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-03-08 23:11:45,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 80 [2025-03-08 23:11:45,662 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:45,664 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 58 [2025-03-08 23:11:45,818 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-03-08 23:11:45,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 111 [2025-03-08 23:11:45,822 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 56 treesize of output 19 [2025-03-08 23:11:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 23 [2025-03-08 23:11:45,970 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:45,970 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 118 treesize of output 82 [2025-03-08 23:11:45,973 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:11:45,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:45,974 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 86 treesize of output 61 [2025-03-08 23:11:46,171 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:11:46,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2025-03-08 23:11:46,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:11:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:11:46,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:11:46,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2637) .cse0) .cse1) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2025-03-08 23:11:46,654 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (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|)) (.cse1 (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|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2637) .cse0) .cse1) 4))))) is different from false [2025-03-08 23:11:46,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:46,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 94 [2025-03-08 23:11:46,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:11:46,670 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 192 treesize of output 195 [2025-03-08 23:11:46,675 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 84 treesize of output 70 [2025-03-08 23:11:46,792 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|))) (let ((.cse5 (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|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2))) (let ((.cse0 (not .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse8 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse2) .cse3)) (+ v_arrayElimCell_234 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_234 4)))) (not .cse6)) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse7 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse8)) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ v_arrayElimCell_234 4))))))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse2) .cse3)) (+ v_arrayElimCell_233 4))))) .cse9) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_arrayElimCell_233 Int)) (let ((.cse10 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse2) .cse3)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_233 4)))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (and (or .cse9 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse2) .cse3)) (+ v_arrayElimCell_233 4))))) (or .cse0 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse2) .cse3)) (+ v_arrayElimCell_234 4))))) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse2) .cse3)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_233 4))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5)) (or .cse6 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem15#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse8)))))))) is different from false [2025-03-08 23:11:46,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse3)) (.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse7)) (.cse6 (not .cse0)) (.cse10 (+ (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#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|))) (and (or (and (or .cse0 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse3) .cse4)) (+ v_arrayElimCell_233 4)) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (let ((.cse5 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse3) .cse4)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 (+ v_arrayElimCell_234 4)))) (= (select .cse5 (+ v_arrayElimCell_233 4)) |c_ULTIMATE.start_main_~data~0#1|)))) (or .cse6 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse3) .cse4)) (+ v_arrayElimCell_234 4)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7)) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse3) .cse4)) (+ v_arrayElimCell_233 4)) |c_ULTIMATE.start_main_~data~0#1|))) .cse0) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_234 4)))) (not .cse9)) (or .cse9 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10)))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse3) .cse4)) (+ v_arrayElimCell_234 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse6) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse10)) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_234 4))))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_arrayElimCell_233 Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2635) .cse3) .cse4)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_234 4)))) (= (select .cse12 (+ v_arrayElimCell_233 4)) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) is different from false [2025-03-08 23:11:47,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| .cse4))) (let ((.cse7 (not .cse6)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| .cse0)) (.cse10 (+ (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (or (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0) (and (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (let ((.cse1 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ v_arrayElimCell_233 4)))))) (or .cse6 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_233 4))))) (or .cse7 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_234 4))))))) (or .cse8 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|))) .cse10)))) (or .cse6 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_233 4)))))) (or .cse7 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_234 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_arrayElimCell_233 Int)) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_233 4)))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|))) (+ v_arrayElimCell_234 4)))) (not .cse8)) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2635) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |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|))))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse10))))))))) is different from false [2025-03-08 23:11:47,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= .cse4 .cse1))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (not .cse0)) (.cse13 (= .cse9 .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse11 (+ (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4))) (and (or .cse0 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_233 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or (and (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_234 4)))) .cse7) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (let ((.cse8 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_233 4))) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_234 4))))))) (or .cse0 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_233 4)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse9)) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse9) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse11))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_arrayElimCell_233 Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_233 4))) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_234 4))))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (not .cse13) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse9) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_234 4))))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_234 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse7) (or .cse13 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse9) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse11)))))))) is different from false [2025-03-08 23:11:47,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= .cse1 .cse4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse1 .cse7)) (.cse11 (+ (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse0 (not .cse10)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#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|))) (and (or .cse0 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_234 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_234 4)))) (not .cse8)) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_arrayElimCell_233 Int)) (let ((.cse9 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ v_arrayElimCell_233 4)))))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_233 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse10) (or .cse8 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse11)))) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse7) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse11))))) (or (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse7) (and (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (let ((.cse13 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_234 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_233 4)))))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_234 4)))) .cse0) (or .cse10 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse1 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2635) .cse4) .cse5)) (+ v_arrayElimCell_233 4))))))))))) is different from false [2025-03-08 23:11:47,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse14)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= .cse2 .cse8)) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ .cse14 4)) (.cse7 (= .cse2 .cse5)) (.cse11 (not .cse10)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse0 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ v_arrayElimCell_234 4))))))) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1))) .cse7) (or (not .cse7) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_234 4))))) (or (and (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse8) .cse9)) (+ v_arrayElimCell_233 4)))) .cse10) (or (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse8) .cse9)) (+ v_arrayElimCell_234 4)))) .cse11) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_233 4))) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_234 4)))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5)) (or .cse10 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_233 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse8) .cse9)) (+ v_arrayElimCell_233 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or .cse11 (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_234 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse8) .cse9)) (+ v_arrayElimCell_234 4))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2635 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_arrayElimCell_233 Int)) (let ((.cse13 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2632) .cse2 v_ArrVal_2636) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2635) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_233 4))) (forall ((v_arrayElimCell_234 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_234 4))))))))))))))) is different from false