./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/memsafety/test-0235-1.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 6e8dd9d71aae7a8c83467a9093ad4bffb4ddd59cddc2d90362f34ff651f24f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:37:35,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:37:35,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:37:35,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:37:35,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:37:35,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:37:35,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:37:35,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:37:35,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:37:35,756 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:37:35,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:37:35,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:37:35,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:37:35,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:37:35,758 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:37:35,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:37:35,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:37:35,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:37:35,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:37:35,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:37:35,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:37:35,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:37:35,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:35,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:37:35,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:37:35,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:37:35,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:37:35,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:37:35,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:37:35,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:37:35,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:37:35,761 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 -> 6e8dd9d71aae7a8c83467a9093ad4bffb4ddd59cddc2d90362f34ff651f24f9a [2025-03-04 07:37:35,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:37:35,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:37:35,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:37:35,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:37:35,992 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:37:35,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-1.i [2025-03-04 07:37:37,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993c8b68c/c46e7addf4ff4deb8a3ce4cd971f1ac3/FLAGa32414c4c [2025-03-04 07:37:37,367 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:37:37,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-1.i [2025-03-04 07:37:37,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993c8b68c/c46e7addf4ff4deb8a3ce4cd971f1ac3/FLAGa32414c4c [2025-03-04 07:37:37,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993c8b68c/c46e7addf4ff4deb8a3ce4cd971f1ac3 [2025-03-04 07:37:37,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:37:37,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:37:37,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:37:37,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:37:37,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:37:37,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:37,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2bb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37, skipping insertion in model container [2025-03-04 07:37:37,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:37,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:37:37,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:37:37,893 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:37:37,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:37:37,949 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:37:37,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37 WrapperNode [2025-03-04 07:37:37,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:37:37,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:37:37,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:37:37,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:37:37,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:37,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:37,982 INFO L138 Inliner]: procedures = 188, calls = 69, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 230 [2025-03-04 07:37:37,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:37:37,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:37:37,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:37:37,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:37:37,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:37,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:37,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,011 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 9, 26]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 1, 12]. [2025-03-04 07:37:38,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:37:38,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:37:38,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:37:38,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:37:38,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (1/1) ... [2025-03-04 07:37:38,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:38,049 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-04 07:37:38,055 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-04 07:37:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:37:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-03-04 07:37:38,072 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-03-04 07:37:38,072 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:37:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:37:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:37:38,190 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:37:38,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:37:38,441 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-03-04 07:37:38,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L786: havoc main_#t~mem37#1.base, main_#t~mem37#1.offset; [2025-03-04 07:37:38,587 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-03-04 07:37:38,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:37:38,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:37:38,598 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:37:38,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:37:38 BoogieIcfgContainer [2025-03-04 07:37:38,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:37:38,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:37:38,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:37:38,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:37:38,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:37:37" (1/3) ... [2025-03-04 07:37:38,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd2638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:37:38, skipping insertion in model container [2025-03-04 07:37:38,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:37" (2/3) ... [2025-03-04 07:37:38,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd2638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:37:38, skipping insertion in model container [2025-03-04 07:37:38,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:37:38" (3/3) ... [2025-03-04 07:37:38,605 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-1.i [2025-03-04 07:37:38,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:37:38,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-1.i that has 3 procedures, 228 locations, 1 initial locations, 11 loop locations, and 85 error locations. [2025-03-04 07:37:38,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:37:38,668 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;@7032ca82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:37:38,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2025-03-04 07:37:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 129 states have (on average 1.9069767441860466) internal successors, (246), 214 states have internal predecessors, (246), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:37:38,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:38,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:37:38,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 8957029, now seen corresponding path program 1 times [2025-03-04 07:37:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235113997] [2025-03-04 07:37:38,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:38,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:37:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:37:38,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:38,768 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-04 07:37:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235113997] [2025-03-04 07:37:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235113997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:37:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181833039] [2025-03-04 07:37:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:37:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:38,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:37:38,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:37:38,796 INFO L87 Difference]: Start difference. First operand has 228 states, 129 states have (on average 1.9069767441860466) internal successors, (246), 214 states have internal predecessors, (246), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:37:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:38,822 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2025-03-04 07:37:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:37:38,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:37:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:38,831 INFO L225 Difference]: With dead ends: 228 [2025-03-04 07:37:38,831 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 07:37:38,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:37:38,836 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:38,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:37:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 07:37:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-04 07:37:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 128 states have (on average 1.8203125) internal successors, (233), 212 states have internal predecessors, (233), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2025-03-04 07:37:38,885 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 4 [2025-03-04 07:37:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2025-03-04 07:37:38,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:37:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2025-03-04 07:37:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:37:38,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:38,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:37:38,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:37:38,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 17855320, now seen corresponding path program 1 times [2025-03-04 07:37:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97483204] [2025-03-04 07:37:38,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:37:38,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:37:38,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:38,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:39,003 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-04 07:37:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97483204] [2025-03-04 07:37:39,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97483204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:39,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:37:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406809399] [2025-03-04 07:37:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:39,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:37:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:39,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:37:39,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:37:39,005 INFO L87 Difference]: Start difference. First operand 226 states and 255 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-04 07:37:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:39,124 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2025-03-04 07:37:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:37:39,125 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-04 07:37:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:39,126 INFO L225 Difference]: With dead ends: 225 [2025-03-04 07:37:39,126 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 07:37:39,126 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-04 07:37:39,126 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:39,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 417 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:37:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 07:37:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-04 07:37:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 128 states have (on average 1.8125) internal successors, (232), 211 states have internal predecessors, (232), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 254 transitions. [2025-03-04 07:37:39,136 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 254 transitions. Word has length 6 [2025-03-04 07:37:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:39,136 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 254 transitions. [2025-03-04 07:37:39,136 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-04 07:37:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2025-03-04 07:37:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:37:39,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:39,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:39,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:37:39,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:39,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 553515021, now seen corresponding path program 1 times [2025-03-04 07:37:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247990548] [2025-03-04 07:37:39,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:39,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:37:39,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:37:39,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:39,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252168079] [2025-03-04 07:37:39,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:39,166 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-04 07:37:39,169 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-04 07:37:39,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:37:39,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:37:39,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:39,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:39,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:37:39,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:39,295 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-04 07:37:39,309 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-04 07:37:39,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247990548] [2025-03-04 07:37:39,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252168079] [2025-03-04 07:37:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252168079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:39,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:37:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279260777] [2025-03-04 07:37:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:39,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:37:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:39,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:37:39,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:37:39,311 INFO L87 Difference]: Start difference. First operand 225 states and 254 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04 07:37:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:39,433 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2025-03-04 07:37:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:37:39,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-04 07:37:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:39,436 INFO L225 Difference]: With dead ends: 234 [2025-03-04 07:37:39,436 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 07:37:39,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 07:37:39,437 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 11 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:39,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 663 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:37:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 07:37:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-04 07:37:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 219 states have internal predecessors, (241), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 263 transitions. [2025-03-04 07:37:39,452 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 263 transitions. Word has length 7 [2025-03-04 07:37:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:39,452 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 263 transitions. [2025-03-04 07:37:39,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04 07:37:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 263 transitions. [2025-03-04 07:37:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:37:39,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:39,453 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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-04 07:37:39,459 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-04 07:37:39,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:39,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:39,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 196707822, now seen corresponding path program 1 times [2025-03-04 07:37:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770109839] [2025-03-04 07:37:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:39,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:37:39,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:37:39,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:39,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621880242] [2025-03-04 07:37:39,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:39,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:39,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:39,762 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-04 07:37:39,763 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-04 07:37:39,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:37:39,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:37:39,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:39,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:39,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:37:39,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:39,943 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 7 [2025-03-04 07:37:39,976 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 13 treesize of output 9 [2025-03-04 07:37:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:37:40,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:40,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770109839] [2025-03-04 07:37:40,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621880242] [2025-03-04 07:37:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621880242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:37:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525640130] [2025-03-04 07:37:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:37:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:37:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:37:40,041 INFO L87 Difference]: Start difference. First operand 234 states and 263 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:37:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:40,173 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2025-03-04 07:37:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:37:40,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-03-04 07:37:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:40,175 INFO L225 Difference]: With dead ends: 246 [2025-03-04 07:37:40,175 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 07:37:40,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:37:40,175 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:40,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 908 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:37:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 07:37:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-04 07:37:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 221 states have internal predecessors, (243), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 265 transitions. [2025-03-04 07:37:40,189 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 265 transitions. Word has length 66 [2025-03-04 07:37:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 265 transitions. [2025-03-04 07:37:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:37:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2025-03-04 07:37:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 07:37:40,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:40,190 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 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-04 07:37:40,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:37:40,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 07:37:40,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:40,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2074062647, now seen corresponding path program 1 times [2025-03-04 07:37:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:40,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159337505] [2025-03-04 07:37:40,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:40,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:37:40,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:37:40,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:40,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817659535] [2025-03-04 07:37:40,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:40,586 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-04 07:37:40,587 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-04 07:37:40,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:37:40,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:37:40,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:40,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:40,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:37:40,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:40,773 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 7 [2025-03-04 07:37:40,800 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 13 treesize of output 9 [2025-03-04 07:37:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 07:37:40,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:37:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 07:37:41,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:41,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159337505] [2025-03-04 07:37:41,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:41,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817659535] [2025-03-04 07:37:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817659535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:37:41,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:37:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-04 07:37:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433676383] [2025-03-04 07:37:41,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:37:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:37:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:41,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:37:41,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:37:41,013 INFO L87 Difference]: Start difference. First operand 236 states and 265 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:37:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:41,291 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2025-03-04 07:37:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:37:41,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2025-03-04 07:37:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:41,294 INFO L225 Difference]: With dead ends: 255 [2025-03-04 07:37:41,294 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 07:37:41,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:37:41,295 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 20 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:41,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1397 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:37:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 07:37:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-04 07:37:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 142 states have (on average 1.7394366197183098) internal successors, (247), 225 states have internal predecessors, (247), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 269 transitions. [2025-03-04 07:37:41,308 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 269 transitions. Word has length 71 [2025-03-04 07:37:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 269 transitions. [2025-03-04 07:37:41,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 07:37:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 269 transitions. [2025-03-04 07:37:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 07:37:41,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:41,310 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 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-04 07:37:41,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:37:41,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:41,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1005850706, now seen corresponding path program 2 times [2025-03-04 07:37:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959429294] [2025-03-04 07:37:41,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:37:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:41,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 07:37:41,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 07:37:41,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:37:41,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46153060] [2025-03-04 07:37:41,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:37:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:41,678 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-04 07:37:41,679 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-04 07:37:41,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 07:37:41,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 07:37:41,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:37:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:42,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:37:42,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:42,035 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-04 07:37:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 07:37:42,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959429294] [2025-03-04 07:37:42,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46153060] [2025-03-04 07:37:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46153060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:37:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405764151] [2025-03-04 07:37:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:42,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:37:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:42,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:37:42,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:37:42,048 INFO L87 Difference]: Start difference. First operand 240 states and 269 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:37:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:42,136 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2025-03-04 07:37:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:37:42,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-03-04 07:37:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:42,138 INFO L225 Difference]: With dead ends: 239 [2025-03-04 07:37:42,138 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 07:37:42,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 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-04 07:37:42,139 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 11 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:42,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 685 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:37:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 07:37:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-04 07:37:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 142 states have (on average 1.732394366197183) internal successors, (246), 224 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 268 transitions. [2025-03-04 07:37:42,148 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 268 transitions. Word has length 86 [2025-03-04 07:37:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 268 transitions. [2025-03-04 07:37:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:37:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 268 transitions. [2025-03-04 07:37:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 07:37:42,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:42,151 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:37:42,161 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-04 07:37:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:42,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash 200762683, now seen corresponding path program 1 times [2025-03-04 07:37:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357600912] [2025-03-04 07:37:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:42,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:37:42,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:37:42,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:42,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 07:37:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357600912] [2025-03-04 07:37:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357600912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:43,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450813843] [2025-03-04 07:37:43,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:43,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:43,125 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-04 07:37:43,127 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-04 07:37:43,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:37:43,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:37:43,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:43,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:43,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:37:43,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:43,387 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-04 07:37:43,427 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:37:43,427 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-04 07:37:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 21 not checked. [2025-03-04 07:37:43,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:37:43,627 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:37:43,627 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 12 treesize of output 11 [2025-03-04 07:37:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 07:37:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450813843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:37:43,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:37:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-03-04 07:37:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465875033] [2025-03-04 07:37:43,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:37:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:37:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:43,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:37:43,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:37:43,649 INFO L87 Difference]: Start difference. First operand 239 states and 268 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 07:37:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:44,160 INFO L93 Difference]: Finished difference Result 338 states and 386 transitions. [2025-03-04 07:37:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:37:44,160 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-03-04 07:37:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:44,162 INFO L225 Difference]: With dead ends: 338 [2025-03-04 07:37:44,162 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 07:37:44,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2025-03-04 07:37:44,163 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 237 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:44,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1671 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 909 Invalid, 0 Unknown, 363 Unchecked, 0.4s Time] [2025-03-04 07:37:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 07:37:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 237. [2025-03-04 07:37:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 142 states have (on average 1.7183098591549295) internal successors, (244), 222 states have internal predecessors, (244), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 266 transitions. [2025-03-04 07:37:44,176 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 266 transitions. Word has length 95 [2025-03-04 07:37:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:44,176 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 266 transitions. [2025-03-04 07:37:44,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 07:37:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 266 transitions. [2025-03-04 07:37:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 07:37:44,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:44,179 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:37:44,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:37:44,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:44,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:44,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 200762684, now seen corresponding path program 1 times [2025-03-04 07:37:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451575801] [2025-03-04 07:37:44,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:37:44,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:37:44,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:44,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256894238] [2025-03-04 07:37:44,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:44,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:44,526 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-04 07:37:44,527 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-04 07:37:44,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:37:44,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:37:44,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:44,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:44,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:37:44,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:44,875 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 7 [2025-03-04 07:37:44,904 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 13 treesize of output 9 [2025-03-04 07:37:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 227 proven. 96 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-04 07:37:45,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:37:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 128 proven. 32 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 07:37:45,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:45,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451575801] [2025-03-04 07:37:45,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:45,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256894238] [2025-03-04 07:37:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256894238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:37:45,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:37:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-04 07:37:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188078343] [2025-03-04 07:37:45,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:37:45,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:37:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:45,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:37:45,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:37:45,251 INFO L87 Difference]: Start difference. First operand 237 states and 266 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 07:37:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:45,748 INFO L93 Difference]: Finished difference Result 259 states and 292 transitions. [2025-03-04 07:37:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:37:45,749 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-03-04 07:37:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:45,749 INFO L225 Difference]: With dead ends: 259 [2025-03-04 07:37:45,750 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 07:37:45,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:37:45,751 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 21 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2775 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:45,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2775 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:37:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 07:37:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-04 07:37:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 149 states have (on average 1.6845637583892616) internal successors, (251), 229 states have internal predecessors, (251), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:37:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2025-03-04 07:37:45,756 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 95 [2025-03-04 07:37:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:45,756 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2025-03-04 07:37:45,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 07:37:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2025-03-04 07:37:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 07:37:45,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:45,757 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:37:45,767 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-04 07:37:45,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:45,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:37:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 36350197, now seen corresponding path program 2 times [2025-03-04 07:37:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210461492] [2025-03-04 07:37:45,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:37:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:46,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-04 07:37:46,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 07:37:46,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:37:46,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 97 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-04 07:37:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210461492] [2025-03-04 07:37:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210461492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:47,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972038800] [2025-03-04 07:37:47,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:37:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:47,743 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-04 07:37:47,744 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-04 07:37:47,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-04 07:37:48,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 07:37:48,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:37:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:48,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 07:37:48,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:48,611 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 10 treesize of output 9 [2025-03-04 07:37:50,251 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-04 07:37:50,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:37:50,308 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-04 07:37:50,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:37:50,316 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-04 07:37:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 503 proven. 316 refuted. 0 times theorem prover too weak. 473 trivial. 103 not checked. [2025-03-04 07:37:50,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:37:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972038800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:50,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:37:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2025-03-04 07:37:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483945425] [2025-03-04 07:37:50,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:37:50,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 07:37:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:50,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 07:37:50,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2014, Unknown=1, NotChecked=90, Total=2256 [2025-03-04 07:37:50,644 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:37:54,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:37:59,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:03,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:07,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:11,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:16,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:17,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:22,406 INFO L93 Difference]: Finished difference Result 351 states and 402 transitions. [2025-03-04 07:38:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:38:22,407 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 118 [2025-03-04 07:38:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:22,409 INFO L225 Difference]: With dead ends: 351 [2025-03-04 07:38:22,409 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 07:38:22,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=296, Invalid=3489, Unknown=1, NotChecked=120, Total=3906 [2025-03-04 07:38:22,410 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 365 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 5940 mSolverCounterSat, 24 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 6331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5940 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:22,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1960 Invalid, 6331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5940 Invalid, 6 Unknown, 361 Unchecked, 30.6s Time] [2025-03-04 07:38:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 07:38:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 242. [2025-03-04 07:38:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 149 states have (on average 1.6711409395973154) internal successors, (249), 227 states have internal predecessors, (249), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:38:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2025-03-04 07:38:22,420 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 118 [2025-03-04 07:38:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:22,421 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2025-03-04 07:38:22,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:38:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2025-03-04 07:38:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 07:38:22,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:22,424 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:38:22,450 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-04 07:38:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:22,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:38:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 572806545, now seen corresponding path program 1 times [2025-03-04 07:38:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795789308] [2025-03-04 07:38:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 07:38:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 07:38:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 833 proven. 96 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-04 07:38:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795789308] [2025-03-04 07:38:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795789308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182212421] [2025-03-04 07:38:23,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:23,686 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-04 07:38:23,688 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-04 07:38:23,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 07:38:23,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 07:38:23,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:23,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:23,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:38:23,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:24,088 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-04 07:38:24,172 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:38:24,172 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-04 07:38:24,207 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-04 07:38:24,239 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:38:24,239 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-04 07:38:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 1 refuted. 0 times theorem prover too weak. 466 trivial. 209 not checked. [2025-03-04 07:38:24,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182212421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:24,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 22 [2025-03-04 07:38:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301649567] [2025-03-04 07:38:24,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:38:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:24,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:38:24,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=487, Unknown=2, NotChecked=90, Total=650 [2025-03-04 07:38:24,489 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:38:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:25,674 INFO L93 Difference]: Finished difference Result 340 states and 388 transitions. [2025-03-04 07:38:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:38:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 120 [2025-03-04 07:38:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:25,676 INFO L225 Difference]: With dead ends: 340 [2025-03-04 07:38:25,676 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 07:38:25,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=708, Unknown=2, NotChecked=110, Total=930 [2025-03-04 07:38:25,677 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 693 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:25,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 2351 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1434 Invalid, 0 Unknown, 715 Unchecked, 1.0s Time] [2025-03-04 07:38:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 07:38:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 239. [2025-03-04 07:38:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 149 states have (on average 1.651006711409396) internal successors, (246), 224 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:38:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 268 transitions. [2025-03-04 07:38:25,683 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 268 transitions. Word has length 120 [2025-03-04 07:38:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 268 transitions. [2025-03-04 07:38:25,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:38:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 268 transitions. [2025-03-04 07:38:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 07:38:25,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:25,684 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:38:25,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:38:25,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:38:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 572806546, now seen corresponding path program 1 times [2025-03-04 07:38:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768695457] [2025-03-04 07:38:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:25,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 07:38:26,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 07:38:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 246 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-04 07:38:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:27,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768695457] [2025-03-04 07:38:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768695457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:27,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926611979] [2025-03-04 07:38:27,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:27,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:27,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:27,854 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-04 07:38:27,854 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-04 07:38:28,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 07:38:28,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 07:38:28,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:28,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:28,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-03-04 07:38:28,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:28,718 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 10 treesize of output 9 [2025-03-04 07:38:30,235 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-04 07:38:30,331 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:38:30,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:38:30,335 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-04 07:38:30,443 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-04 07:38:30,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:30,494 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 14 treesize of output 9 [2025-03-04 07:38:30,508 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:38:30,508 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-04 07:38:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 444 proven. 365 refuted. 0 times theorem prover too weak. 152 trivial. 434 not checked. [2025-03-04 07:38:30,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926611979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:30,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33] total 54 [2025-03-04 07:38:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558539331] [2025-03-04 07:38:30,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:30,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 07:38:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:30,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 07:38:30,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2778, Unknown=2, NotChecked=214, Total=3192 [2025-03-04 07:38:30,736 INFO L87 Difference]: Start difference. First operand 239 states and 268 transitions. Second operand has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 07:38:34,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:38:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:39,863 INFO L93 Difference]: Finished difference Result 378 states and 441 transitions. [2025-03-04 07:38:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:38:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 120 [2025-03-04 07:38:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:39,865 INFO L225 Difference]: With dead ends: 378 [2025-03-04 07:38:39,865 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 07:38:39,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=479, Invalid=5689, Unknown=2, NotChecked=310, Total=6480 [2025-03-04 07:38:39,867 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 437 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 5453 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 6269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5453 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:39,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1702 Invalid, 6269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 5453 Invalid, 1 Unknown, 777 Unchecked, 7.1s Time] [2025-03-04 07:38:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 07:38:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 236. [2025-03-04 07:38:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 149 states have (on average 1.6308724832214765) internal successors, (243), 221 states have internal predecessors, (243), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:38:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 265 transitions. [2025-03-04 07:38:39,876 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 265 transitions. Word has length 120 [2025-03-04 07:38:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:39,876 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 265 transitions. [2025-03-04 07:38:39,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 07:38:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2025-03-04 07:38:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 07:38:39,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:39,877 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:38:39,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:40,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:40,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:38:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1106359573, now seen corresponding path program 1 times [2025-03-04 07:38:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:40,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209206292] [2025-03-04 07:38:40,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:40,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 07:38:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 07:38:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 773 proven. 245 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 07:38:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209206292] [2025-03-04 07:38:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209206292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565533564] [2025-03-04 07:38:41,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:41,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:41,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:41,226 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-04 07:38:41,227 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-04 07:38:41,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 07:38:41,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 07:38:41,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:41,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-04 07:38:41,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:41,705 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-04 07:38:41,707 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-04 07:38:41,718 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-04 07:38:41,719 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-04 07:38:41,732 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-04 07:38:41,734 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-04 07:38:41,852 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-04 07:38:41,855 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-04 07:38:41,903 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-03-04 07:38:41,906 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-03-04 07:38:41,941 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-03-04 07:38:41,988 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:38:41,989 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-04 07:38:42,085 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2025-03-04 07:38:42,088 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2025-03-04 07:38:42,212 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from false [2025-03-04 07:38:42,216 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from true [2025-03-04 07:38:42,410 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|))))))) is different from false [2025-03-04 07:38:42,418 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|))))))) is different from true [2025-03-04 07:38:42,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse2))) is different from false [2025-03-04 07:38:42,656 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse3)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse2))) is different from true [2025-03-04 07:38:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 660 proven. 262 refuted. 0 times theorem prover too weak. 293 trivial. 180 not checked. [2025-03-04 07:38:42,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565533564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:42,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 34 [2025-03-04 07:38:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870600289] [2025-03-04 07:38:42,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:42,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:38:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:42,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:38:42,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=673, Unknown=19, NotChecked=610, Total=1406 [2025-03-04 07:38:42,856 INFO L87 Difference]: Start difference. First operand 236 states and 265 transitions. Second operand has 35 states, 32 states have (on average 2.78125) internal successors, (89), 28 states have internal predecessors, (89), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:38:43,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from false [2025-03-04 07:38:43,128 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret9#1.base| .cse0)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from true [2025-03-04 07:38:43,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from false [2025-03-04 07:38:43,132 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from true [2025-03-04 07:38:43,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) .cse0))) is different from false [2025-03-04 07:38:43,137 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) .cse0))) is different from true [2025-03-04 07:38:43,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-04 07:38:43,160 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-04 07:38:43,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-04 07:38:43,183 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) .cse4) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-04 07:38:43,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-04 07:38:43,265 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-04 07:38:43,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-04 07:38:43,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-04 07:38:43,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|)))))) .cse3)) is different from false [2025-03-04 07:38:43,371 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|)))))) .cse3)) is different from true [2025-03-04 07:38:43,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse5) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse2))) .cse3)) is different from false [2025-03-04 07:38:43,406 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3305 Int)) (= (select |c_#valid| v_ArrVal_3305) 1))) (.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_52|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_52| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)))))) .cse1) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse1 .cse3) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_51|)) (.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= 1 (select |c_#valid| .cse4)) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse5) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse2))) .cse3)) is different from true [2025-03-04 07:38:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:44,275 INFO L93 Difference]: Finished difference Result 356 states and 410 transitions. [2025-03-04 07:38:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:38:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.78125) internal successors, (89), 28 states have internal predecessors, (89), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 126 [2025-03-04 07:38:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:44,276 INFO L225 Difference]: With dead ends: 356 [2025-03-04 07:38:44,277 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 07:38:44,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=936, Unknown=37, NotChecked=1520, Total=2652 [2025-03-04 07:38:44,277 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 232 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 6158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4275 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:44,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 2960 Invalid, 6158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1850 Invalid, 0 Unknown, 4275 Unchecked, 1.0s Time] [2025-03-04 07:38:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 07:38:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 255. [2025-03-04 07:38:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 165 states have (on average 1.587878787878788) internal successors, (262), 237 states have internal predecessors, (262), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:38:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 290 transitions. [2025-03-04 07:38:44,283 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 290 transitions. Word has length 126 [2025-03-04 07:38:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:44,283 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 290 transitions. [2025-03-04 07:38:44,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.78125) internal successors, (89), 28 states have internal predecessors, (89), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 07:38:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 290 transitions. [2025-03-04 07:38:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 07:38:44,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:44,284 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:38:44,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:38:44,485 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,SelfDestructingSolverStorable11 [2025-03-04 07:38:44,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:38:44,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1106359572, now seen corresponding path program 1 times [2025-03-04 07:38:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140407411] [2025-03-04 07:38:44,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:44,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 07:38:44,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 07:38:44,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:44,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 659 proven. 483 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-04 07:38:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140407411] [2025-03-04 07:38:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140407411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46462516] [2025-03-04 07:38:47,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:47,236 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-04 07:38:47,236 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-04 07:38:47,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 07:38:48,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 07:38:48,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:48,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:48,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-03-04 07:38:48,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:49,105 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 10 treesize of output 9 [2025-03-04 07:38:51,641 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:38:51,641 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-04 07:38:51,655 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:38:51,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:38:52,081 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 07:38:52,081 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 22 treesize of output 33 [2025-03-04 07:38:52,095 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-04 07:38:52,343 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-03-04 07:38:52,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:52,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-04 07:38:52,433 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-04 07:38:52,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-03-04 07:38:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 403 proven. 528 refuted. 0 times theorem prover too weak. 233 trivial. 231 not checked. [2025-03-04 07:38:52,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46462516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:52,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 41] total 70 [2025-03-04 07:38:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148108845] [2025-03-04 07:38:52,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-04 07:38:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-04 07:38:52,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=4819, Unknown=1, NotChecked=140, Total=5256 [2025-03-04 07:38:52,898 INFO L87 Difference]: Start difference. First operand 255 states and 290 transitions. Second operand has 71 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 64 states have internal predecessors, (130), 6 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:38:56,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 07:39:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:05,348 INFO L93 Difference]: Finished difference Result 419 states and 501 transitions. [2025-03-04 07:39:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 07:39:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 64 states have internal predecessors, (130), 6 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 126 [2025-03-04 07:39:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:05,350 INFO L225 Difference]: With dead ends: 419 [2025-03-04 07:39:05,350 INFO L226 Difference]: Without dead ends: 419 [2025-03-04 07:39:05,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2661 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=697, Invalid=9406, Unknown=1, NotChecked=198, Total=10302 [2025-03-04 07:39:05,352 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 710 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 8288 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 8753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 8288 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:05,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 2057 Invalid, 8753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 8288 Invalid, 1 Unknown, 394 Unchecked, 9.5s Time] [2025-03-04 07:39:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-04 07:39:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 230. [2025-03-04 07:39:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 149 states have (on average 1.5906040268456376) internal successors, (237), 215 states have internal predecessors, (237), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:39:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2025-03-04 07:39:05,364 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 259 transitions. Word has length 126 [2025-03-04 07:39:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:05,364 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 259 transitions. [2025-03-04 07:39:05,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 64 states have internal predecessors, (130), 6 states have call successors, (9), 2 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:39:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2025-03-04 07:39:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 07:39:05,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:05,365 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 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-04 07:39:05,390 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-04 07:39:05,566 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,SelfDestructingSolverStorable12 [2025-03-04 07:39:05,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 82 more)] === [2025-03-04 07:39:05,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -537851930, now seen corresponding path program 1 times [2025-03-04 07:39:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:05,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919367835] [2025-03-04 07:39:05,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:05,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 07:39:05,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 07:39:05,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:05,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat