./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0234-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0234-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:17:16,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:17:16,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:17:16,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:17:16,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:17:16,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:17:16,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:17:16,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:17:16,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:17:16,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:17:16,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:17:16,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:17:16,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:17:16,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:17:16,209 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:17:16,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:17:16,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:17:16,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:17:16,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:17:16,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:17:16,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:17:16,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:17:16,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:17:16,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:16,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:17:16,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:17:16,212 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-jdk21/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 -> 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c [2025-02-06 10:17:16,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:17:16,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:17:16,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:17:16,418 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:17:16,418 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:17:16,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0234-1.i [2025-02-06 10:17:17,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e1951d4/54103d89bf774af688b3fa9b65ba9b31/FLAGbb4ed7516 [2025-02-06 10:17:17,807 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:17:17,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0234-1.i [2025-02-06 10:17:17,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e1951d4/54103d89bf774af688b3fa9b65ba9b31/FLAGbb4ed7516 [2025-02-06 10:17:18,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e1951d4/54103d89bf774af688b3fa9b65ba9b31 [2025-02-06 10:17:18,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:17:18,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:17:18,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:18,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:17:18,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:17:18,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790dd15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18, skipping insertion in model container [2025-02-06 10:17:18,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:17:18,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:18,287 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:17:18,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:18,348 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:17:18,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18 WrapperNode [2025-02-06 10:17:18,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:18,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:18,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:17:18,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:17:18,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,380 INFO L138 Inliner]: procedures = 188, calls = 60, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 203 [2025-02-06 10:17:18,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:18,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:17:18,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:17:18,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:17:18,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,410 INFO L175 MemorySlicer]: Split 32 memory accesses to 3 slices as follows [2, 4, 26]. 81 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-02-06 10:17:18,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:17:18,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:17:18,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:17:18,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:17:18,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (1/1) ... [2025-02-06 10:17:18,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:18,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:18,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:17:18,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:17:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:17:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-02-06 10:17:18,473 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:17:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:17:18,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:17:18,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:17:18,585 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:17:18,586 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:17:18,667 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-02-06 10:17:19,024 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2025-02-06 10:17:19,024 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:17:19,038 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:17:19,039 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:17:19,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:19 BoogieIcfgContainer [2025-02-06 10:17:19,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:17:19,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:17:19,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:17:19,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:17:19,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:17:18" (1/3) ... [2025-02-06 10:17:19,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2e9651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:19, skipping insertion in model container [2025-02-06 10:17:19,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:18" (2/3) ... [2025-02-06 10:17:19,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2e9651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:19, skipping insertion in model container [2025-02-06 10:17:19,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:19" (3/3) ... [2025-02-06 10:17:19,051 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0234-1.i [2025-02-06 10:17:19,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:17:19,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0234-1.i that has 2 procedures, 191 locations, 1 initial locations, 11 loop locations, and 75 error locations. [2025-02-06 10:17:19,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:17:19,117 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;@3cbd353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:17:19,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-02-06 10:17:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 108 states have (on average 1.8981481481481481) internal successors, (205), 183 states have internal predecessors, (205), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:17:19,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:19,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:17:19,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:19,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 7479397, now seen corresponding path program 1 times [2025-02-06 10:17:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:19,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201126698] [2025-02-06 10:17:19,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:19,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:17:19,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:17:19,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:19,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201126698] [2025-02-06 10:17:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201126698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:19,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:19,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314268490] [2025-02-06 10:17:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:19,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:17:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:19,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:17:19,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:19,241 INFO L87 Difference]: Start difference. First operand has 191 states, 108 states have (on average 1.8981481481481481) internal successors, (205), 183 states have internal predecessors, (205), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-02-06 10:17:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:19,256 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2025-02-06 10:17:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:17:19,257 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-02-06 10:17:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:19,262 INFO L225 Difference]: With dead ends: 191 [2025-02-06 10:17:19,262 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 10:17:19,263 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-02-06 10:17:19,265 INFO L435 NwaCegarLoop]: 206 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, 206 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-02-06 10:17:19,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:17:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 10:17:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-06 10:17:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2025-02-06 10:17:19,294 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 4 [2025-02-06 10:17:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:19,294 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2025-02-06 10:17:19,295 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-02-06 10:17:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2025-02-06 10:17:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:19,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:19,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:19,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:17:19,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:19,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1402162514, now seen corresponding path program 1 times [2025-02-06 10:17:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:19,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047241172] [2025-02-06 10:17:19,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:19,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:19,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:19,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:19,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047241172] [2025-02-06 10:17:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047241172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:19,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749952442] [2025-02-06 10:17:19,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:19,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:19,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:19,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:19,380 INFO L87 Difference]: Start difference. First operand 189 states and 204 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-02-06 10:17:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:19,534 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2025-02-06 10:17:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:19,535 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-02-06 10:17:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:19,536 INFO L225 Difference]: With dead ends: 188 [2025-02-06 10:17:19,538 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 10:17:19,538 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-02-06 10:17:19,538 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:19,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 325 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 10:17:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-06 10:17:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2025-02-06 10:17:19,553 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 6 [2025-02-06 10:17:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2025-02-06 10:17:19,554 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-02-06 10:17:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2025-02-06 10:17:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:17:19,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:19,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:19,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:17:19,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:19,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash -517364994, now seen corresponding path program 1 times [2025-02-06 10:17:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:19,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812175349] [2025-02-06 10:17:19,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:19,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:17:19,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:17:19,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650185640] [2025-02-06 10:17:19,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:19,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:19,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:19,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:19,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:17:19,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:17:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:17:19,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:19,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:19,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:17:19,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:19,704 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-02-06 10:17:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:19,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812175349] [2025-02-06 10:17:19,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650185640] [2025-02-06 10:17:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650185640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108197383] [2025-02-06 10:17:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:19,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:19,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:19,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:19,722 INFO L87 Difference]: Start difference. First operand 188 states and 203 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-02-06 10:17:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:19,911 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2025-02-06 10:17:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:17:19,912 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-02-06 10:17:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:19,913 INFO L225 Difference]: With dead ends: 197 [2025-02-06 10:17:19,913 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 10:17:19,913 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-02-06 10:17:19,913 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:19,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 520 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 10:17:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-06 10:17:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 188 states have internal predecessors, (200), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2025-02-06 10:17:19,924 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 7 [2025-02-06 10:17:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:19,924 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2025-02-06 10:17:19,924 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-02-06 10:17:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2025-02-06 10:17:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:17:19,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:19,926 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-02-06 10:17:19,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:20,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:20,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:20,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -713006385, now seen corresponding path program 1 times [2025-02-06 10:17:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961927417] [2025-02-06 10:17:20,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:20,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:17:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:17:20,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:20,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:20,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009119749] [2025-02-06 10:17:20,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:20,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:20,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:20,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:20,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:17:20,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:17:20,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:17:20,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:20,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:20,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:17:20,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 10:17:20,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961927417] [2025-02-06 10:17:20,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009119749] [2025-02-06 10:17:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009119749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:20,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:20,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:17:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088364285] [2025-02-06 10:17:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:17:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:20,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:17:20,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:20,376 INFO L87 Difference]: Start difference. First operand 197 states and 212 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-02-06 10:17:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:20,407 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2025-02-06 10:17:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:17:20,407 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-02-06 10:17:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:20,408 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:17:20,408 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 10:17:20,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:20,409 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:20,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 582 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:17:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 10:17:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-06 10:17:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 190 states have internal predecessors, (202), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 214 transitions. [2025-02-06 10:17:20,421 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 214 transitions. Word has length 66 [2025-02-06 10:17:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:20,421 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 214 transitions. [2025-02-06 10:17:20,421 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-02-06 10:17:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 214 transitions. [2025-02-06 10:17:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:17:20,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:20,424 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-02-06 10:17:20,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:20,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:20,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1428875771, now seen corresponding path program 1 times [2025-02-06 10:17:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600729092] [2025-02-06 10:17:20,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:20,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 10:17:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:17:20,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:20,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071230618] [2025-02-06 10:17:20,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:20,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:20,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:17:20,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 10:17:21,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:17:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:21,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:21,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 10:17:21,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:21,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:17:21,117 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-02-06 10:17:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 10:17:21,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-06 10:17:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600729092] [2025-02-06 10:17:21,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071230618] [2025-02-06 10:17:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071230618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:21,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2025-02-06 10:17:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396945960] [2025-02-06 10:17:21,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:21,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:17:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:21,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:17:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:17:21,436 INFO L87 Difference]: Start difference. First operand 199 states and 214 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 10:17:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:21,780 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2025-02-06 10:17:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:17:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-02-06 10:17:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:21,781 INFO L225 Difference]: With dead ends: 218 [2025-02-06 10:17:21,781 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 10:17:21,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:17:21,782 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 31 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:21,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1492 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 10:17:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-06 10:17:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 121 states have (on average 1.7024793388429753) internal successors, (206), 194 states have internal predecessors, (206), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 218 transitions. [2025-02-06 10:17:21,787 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 218 transitions. Word has length 71 [2025-02-06 10:17:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:21,787 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 218 transitions. [2025-02-06 10:17:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 10:17:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 218 transitions. [2025-02-06 10:17:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 10:17:21,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:21,788 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-02-06 10:17:21,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:21,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:21,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:21,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1533856177, now seen corresponding path program 2 times [2025-02-06 10:17:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646962513] [2025-02-06 10:17:21,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:17:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:22,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-06 10:17:22,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:17:22,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:17:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14384481] [2025-02-06 10:17:22,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:17:22,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:22,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:22,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:22,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:17:22,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-06 10:17:22,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:17:22,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:17:22,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:22,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:17:22,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:22,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:17:22,527 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-02-06 10:17:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 127 proven. 96 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-06 10:17:22,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 10:17:22,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:22,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646962513] [2025-02-06 10:17:22,905 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:22,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14384481] [2025-02-06 10:17:22,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14384481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:22,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:22,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-02-06 10:17:22,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195213525] [2025-02-06 10:17:22,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:22,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:17:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:22,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:17:22,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:17:22,907 INFO L87 Difference]: Start difference. First operand 203 states and 218 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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-02-06 10:17:31,118 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 10:17:39,261 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 10:17:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:43,808 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2025-02-06 10:17:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:17:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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 86 [2025-02-06 10:17:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:43,810 INFO L225 Difference]: With dead ends: 227 [2025-02-06 10:17:43,810 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 10:17:43,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=307, Invalid=952, Unknown=1, NotChecked=0, Total=1260 [2025-02-06 10:17:43,811 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 27 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:43,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2204 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:17:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 10:17:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-02-06 10:17:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 130 states have (on average 1.676923076923077) internal successors, (218), 203 states have internal predecessors, (218), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2025-02-06 10:17:43,820 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 86 [2025-02-06 10:17:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:43,820 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2025-02-06 10:17:43,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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-02-06 10:17:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2025-02-06 10:17:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 10:17:43,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:43,821 INFO L218 NwaCegarLoop]: trace histogram [40, 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-02-06 10:17:43,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:17:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 10:17:44,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1458157105, now seen corresponding path program 3 times [2025-02-06 10:17:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691393697] [2025-02-06 10:17:44,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:17:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:44,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-02-06 10:17:44,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 10:17:44,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-02-06 10:17:44,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632057624] [2025-02-06 10:17:44,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:17:44,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:44,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:44,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:44,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:17:44,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-02-06 10:17:44,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 106 statements. [2025-02-06 10:17:44,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 10:17:44,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:44,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:17:44,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:44,651 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-02-06 10:17:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2025-02-06 10:17:44,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:44,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:44,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691393697] [2025-02-06 10:17:44,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632057624] [2025-02-06 10:17:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632057624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756326376] [2025-02-06 10:17:44,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:44,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:44,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:44,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:44,670 INFO L87 Difference]: Start difference. First operand 212 states and 230 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-02-06 10:17:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:44,768 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2025-02-06 10:17:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:17:44,768 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 106 [2025-02-06 10:17:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:44,769 INFO L225 Difference]: With dead ends: 211 [2025-02-06 10:17:44,771 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 10:17:44,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-02-06 10:17:44,771 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 11 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:44,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 542 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 10:17:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-06 10:17:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 130 states have (on average 1.6692307692307693) internal successors, (217), 202 states have internal predecessors, (217), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 229 transitions. [2025-02-06 10:17:44,779 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 229 transitions. Word has length 106 [2025-02-06 10:17:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:44,780 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 229 transitions. [2025-02-06 10:17:44,780 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-02-06 10:17:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 229 transitions. [2025-02-06 10:17:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 10:17:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:44,784 INFO L218 NwaCegarLoop]: trace histogram [42, 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-02-06 10:17:44,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:44,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:44,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:44,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:44,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2104812587, now seen corresponding path program 1 times [2025-02-06 10:17:44,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:44,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178982045] [2025-02-06 10:17:44,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:44,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:45,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 10:17:45,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 10:17:45,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:45,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 523 proven. 4 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-06 10:17:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178982045] [2025-02-06 10:17:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178982045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:17:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614677878] [2025-02-06 10:17:45,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:45,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:45,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:45,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:17:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 10:17:46,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 10:17:46,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:46,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:46,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:17:46,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:46,317 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-02-06 10:17:46,352 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:17:46,352 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-02-06 10:17:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 33 not checked. [2025-02-06 10:17:46,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:46,619 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:17:46,619 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-02-06 10:17:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 34 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-06 10:17:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614677878] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:46,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:17:46,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-02-06 10:17:46,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279407166] [2025-02-06 10:17:46,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:46,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:17:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:46,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:17:46,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-02-06 10:17:46,640 INFO L87 Difference]: Start difference. First operand 211 states and 229 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-02-06 10:17:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:47,253 INFO L93 Difference]: Finished difference Result 209 states and 227 transitions. [2025-02-06 10:17:47,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:17:47,254 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 115 [2025-02-06 10:17:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:47,255 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:17:47,255 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:17:47,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2025-02-06 10:17:47,255 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 17 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:47,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1490 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 843 Invalid, 0 Unknown, 192 Unchecked, 0.5s Time] [2025-02-06 10:17:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:17:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-06 10:17:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 130 states have (on average 1.6538461538461537) internal successors, (215), 200 states have internal predecessors, (215), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:17:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 227 transitions. [2025-02-06 10:17:47,259 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 227 transitions. Word has length 115 [2025-02-06 10:17:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:47,260 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 227 transitions. [2025-02-06 10:17:47,260 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-02-06 10:17:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 227 transitions. [2025-02-06 10:17:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 10:17:47,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:47,261 INFO L218 NwaCegarLoop]: trace histogram [42, 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-02-06 10:17:47,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:17:47,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 10:17:47,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:17:47,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2104812588, now seen corresponding path program 1 times [2025-02-06 10:17:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391374083] [2025-02-06 10:17:47,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:47,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 10:17:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 10:17:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 70 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-02-06 10:17:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391374083] [2025-02-06 10:17:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391374083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:17:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963254649] [2025-02-06 10:17:49,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:49,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:49,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:17:49,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 10:17:50,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 10:17:50,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:50,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-06 10:17:50,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:50,465 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-02-06 10:17:56,038 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-02-06 10:17:56,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:17:56,075 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-02-06 10:17:56,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:17:56,082 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-02-06 10:17:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 398 proven. 499 refuted. 0 times theorem prover too weak. 272 trivial. 79 not checked. [2025-02-06 10:17:56,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963254649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:17:56,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2025-02-06 10:17:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096471053] [2025-02-06 10:17:56,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:17:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:56,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:17:56,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2194, Unknown=2, NotChecked=94, Total=2450 [2025-02-06 10:17:56,327 INFO L87 Difference]: Start difference. First operand 209 states and 227 transitions. Second operand has 48 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 43 states have internal predecessors, (84), 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-02-06 10:18:00,365 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-02-06 10:18:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:04,090 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2025-02-06 10:18:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:18:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 43 states have internal predecessors, (84), 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 115 [2025-02-06 10:18:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:04,093 INFO L225 Difference]: With dead ends: 238 [2025-02-06 10:18:04,093 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 10:18:04,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=344, Invalid=4350, Unknown=2, NotChecked=134, Total=4830 [2025-02-06 10:18:04,098 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 48 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 2463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:04,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3281 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2240 Invalid, 1 Unknown, 211 Unchecked, 6.1s Time] [2025-02-06 10:18:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 10:18:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 207. [2025-02-06 10:18:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 198 states have internal predecessors, (213), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:18:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 225 transitions. [2025-02-06 10:18:04,103 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 225 transitions. Word has length 115 [2025-02-06 10:18:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 225 transitions. [2025-02-06 10:18:04,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 43 states have internal predecessors, (84), 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-02-06 10:18:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2025-02-06 10:18:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 10:18:04,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:04,104 INFO L218 NwaCegarLoop]: trace histogram [42, 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-02-06 10:18:04,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:04,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:04,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:18:04,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash -204695288, now seen corresponding path program 1 times [2025-02-06 10:18:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:04,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771496687] [2025-02-06 10:18:04,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:04,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 10:18:04,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 10:18:04,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:04,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 668 proven. 126 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 10:18:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771496687] [2025-02-06 10:18:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771496687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057124645] [2025-02-06 10:18:05,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:05,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:05,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:18:05,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 10:18:05,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 10:18:05,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:05,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:05,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:18:05,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:05,707 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-02-06 10:18:05,737 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:18:05,737 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-02-06 10:18:05,786 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:18:05,787 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-02-06 10:18:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 2 refuted. 0 times theorem prover too weak. 488 trivial. 120 not checked. [2025-02-06 10:18:05,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:06,189 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:18:06,189 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-02-06 10:18:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 122 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-02-06 10:18:06,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057124645] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:06,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 23 [2025-02-06 10:18:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446341998] [2025-02-06 10:18:06,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:06,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:18:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:06,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:18:06,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-02-06 10:18:06,205 INFO L87 Difference]: Start difference. First operand 207 states and 225 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 10:18:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:07,159 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2025-02-06 10:18:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:18:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 117 [2025-02-06 10:18:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:07,160 INFO L225 Difference]: With dead ends: 204 [2025-02-06 10:18:07,160 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 10:18:07,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=655, Unknown=1, NotChecked=52, Total=812 [2025-02-06 10:18:07,161 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 30 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:07,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2161 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1394 Invalid, 0 Unknown, 187 Unchecked, 0.8s Time] [2025-02-06 10:18:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 10:18:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 10:18:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 195 states have internal predecessors, (210), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:18:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2025-02-06 10:18:07,165 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 117 [2025-02-06 10:18:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2025-02-06 10:18:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 10:18:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2025-02-06 10:18:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 10:18:07,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:07,166 INFO L218 NwaCegarLoop]: trace histogram [42, 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-02-06 10:18:07,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:18:07,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:07,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:18:07,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -204695287, now seen corresponding path program 1 times [2025-02-06 10:18:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348283555] [2025-02-06 10:18:07,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:07,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 10:18:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 10:18:07,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:07,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 192 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-02-06 10:18:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348283555] [2025-02-06 10:18:09,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348283555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400691844] [2025-02-06 10:18:09,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:09,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:09,235 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:09,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:18:09,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 10:18:09,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 10:18:09,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:09,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:09,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-06 10:18:09,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:10,131 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-02-06 10:18:14,589 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:18:14,590 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-02-06 10:18:14,603 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-02-06 10:18:14,727 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-02-06 10:18:14,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:14,779 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-02-06 10:18:14,790 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:14,790 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-02-06 10:18:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 498 proven. 404 refuted. 0 times theorem prover too weak. 257 trivial. 89 not checked. [2025-02-06 10:18:14,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400691844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:15,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:18:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33] total 53 [2025-02-06 10:18:15,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189351110] [2025-02-06 10:18:15,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:15,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-06 10:18:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:15,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-06 10:18:15,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2806, Unknown=1, NotChecked=106, Total=3080 [2025-02-06 10:18:15,089 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 50 states have internal predecessors, (101), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 10:18:19,157 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-02-06 10:18:23,465 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-02-06 10:18:27,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:32,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:36,265 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-02-06 10:18:40,529 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-02-06 10:18:44,668 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-02-06 10:18:48,861 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-02-06 10:18:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:53,381 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2025-02-06 10:18:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:18:53,382 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 50 states have internal predecessors, (101), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) Word has length 117 [2025-02-06 10:18:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:53,386 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:18:53,387 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:18:53,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=344, Invalid=4629, Unknown=1, NotChecked=138, Total=5112 [2025-02-06 10:18:53,388 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 66 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 18 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 35.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:53,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 3348 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2836 Invalid, 8 Unknown, 184 Unchecked, 35.8s Time] [2025-02-06 10:18:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:18:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2025-02-06 10:18:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 130 states have (on average 1.5923076923076922) internal successors, (207), 192 states have internal predecessors, (207), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:18:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 219 transitions. [2025-02-06 10:18:53,394 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 219 transitions. Word has length 117 [2025-02-06 10:18:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:53,394 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 219 transitions. [2025-02-06 10:18:53,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 50 states have internal predecessors, (101), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 10:18:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2025-02-06 10:18:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 10:18:53,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:53,395 INFO L218 NwaCegarLoop]: trace histogram [42, 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-02-06 10:18:53,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:53,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:53,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-02-06 10:18:53,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 899303202, now seen corresponding path program 1 times [2025-02-06 10:18:53,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:53,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056441441] [2025-02-06 10:18:53,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:53,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 10:18:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 10:18:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 695 proven. 188 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-02-06 10:18:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056441441] [2025-02-06 10:18:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056441441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054062512] [2025-02-06 10:18:54,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:54,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:54,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:54,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:18:55,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 10:18:55,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 10:18:55,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:55,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:55,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:18:55,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:55,302 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |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-02-06 10:18:55,304 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |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-02-06 10:18:55,316 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from false [2025-02-06 10:18:55,318 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from true [2025-02-06 10:18:55,332 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |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-02-06 10:18:55,335 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |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-02-06 10:18:55,444 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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from false [2025-02-06 10:18:55,450 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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from true [2025-02-06 10:18:55,508 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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from false [2025-02-06 10:18:55,513 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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from true [2025-02-06 10:18:55,556 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-02-06 10:18:55,601 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:18:55,602 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-02-06 10:18:55,726 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_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |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 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int 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) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#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)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2025-02-06 10:18:55,730 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_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |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 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int 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) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#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)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2025-02-06 10:18:55,825 WARN L851 $PredicateComparison]: unable to prove that (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_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |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 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int 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) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#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)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from false [2025-02-06 10:18:55,829 WARN L873 $PredicateComparison]: unable to prove that (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_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |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_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |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 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int 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) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#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)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from true [2025-02-06 10:18:56,041 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)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |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)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (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))))) (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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .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|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |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))))) is different from false [2025-02-06 10:18:56,045 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)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |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)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (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))))) (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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .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|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |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))))) is different from true [2025-02-06 10:18:56,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3621 Int)) (= 1 (select |c_#valid| v_ArrVal_3621)))) (.cse4 (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)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |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)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |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)) .cse4 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 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)))) .cse4))) is different from false [2025-02-06 10:18:56,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3621 Int)) (= 1 (select |c_#valid| v_ArrVal_3621)))) (.cse4 (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)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |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)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |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)) .cse4 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 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)))) .cse4))) is different from true